Kai Hoppmann-Baum

According to our database, Kai Hoppmann-Baum authored at least 8 papers between 2017 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Correction to: Bounding the final rank during a round robin tournament with integer programming.

Uwe Gotzes, Kai Hoppmann

Oper. Res., 2022

Bounding the final rank during a round robin tournament with integer programming.

Uwe Gotzes, Kai Hoppmann

Oper. Res., 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

On the Complexity of Computing Maximum and Minimum Min-Cost-Flows.

Kai Hoppmann-Baum

Networks, 2022

2021

The maximum diversity assortment selection problem.

Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch

Math. Methods Oper. Res., 2021

Blending Hydrogen into Natural Gas: An Assessment of the Capacity of the German Gas Grid.

Jaap Pedersen, Kai Hoppmann-Baum, Janina Zittel, Thorsten Koch

Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

2020

Minimum Cycle Partition with Length Requirements.

Kai Hoppmann, Gioni Mexi, Oleg Burdakov, Carl Johan Casselgren, Thorsten Koch

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2017

Finding Maximum Minimum Cost Flows to Evaluate Gas Network Capacities.

Kai Hoppmann, Robert Schwarz

Proceedings of the Operations Research Proceedings 2017, 2017