Finding Maximum Minimum Cost Flows to Evaluate Gas Network Capacities. - Kai Hoppmann; Robert Schwarz (OR, 2017)

Minimum Cycle Partition with Length Requirements. - Kai Hoppmann; Gioni Mexi; Oleg Burdakov; Carl Johan Casselgren; Thorsten Koch (CPAIOR, 2020)

Blending Hydrogen into Natural Gas: An Assessment of the Capacity of the German Gas Grid. - Jaap Pedersen; Kai Hoppmann-Baum; Janina Zittel; Thorsten Koch (OR, 2021)

The maximum diversity assortment selection problem. - Felix Prause; Kai Hoppmann-Baum; Boris Defourny; Thorsten Koch (Math. Methods Oper. Res., 2021)

On the Complexity of Computing Maximum and Minimum Min-Cost-Flows. - Kai Hoppmann-Baum (Networks, 2022)

Length-constrained cycle partition with an application to UAV routing. - Kai Hoppmann-Baum; Oleg Burdakov; Gioni Mexi; Carl Johan Casselgren; Thorsten Koch (Optim. Methods Softw., 2022)

Bounding the final rank during a round robin tournament with integer programming. - Uwe Gotzes; Kai Hoppmann (Oper. Res., 2022)

Correction to: Bounding the final rank during a round robin tournament with integer programming. - Uwe Gotzes; Kai Hoppmann (Oper. Res., 2022)

Optimizing transient gas network control for challenging real-world instances using MIP-based heuristics. - Felix Hennings; Kai Hoppmann-Baum; Janina Zittel (Open J. Math. Optim., 2024)