Výsledky vyhledávání - "Kai Hoppmann"

Length-constrained cycle partition with an application to UAV routing*

Autor: Kai Hoppmann-Baum, Oleg Burdakov, Gioni Mexi, Carl Johan Casselgren, Thorsten Koch

Publikováno v: Optimization Methods and Software. 37:2080-2116

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e7a3e3ca827a72cef7643f7ee777c7cd
https://doi.org/10.1080/10556788.2022.2053972

Zobrazit plný text záznamu

Plný text ve formátu HTML

On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows

Autor: Kai Hoppmann-Baum

Publikováno v: Networks. 79:236-248

Consider a flow network, i.e., a directed graph where each arc has a nonnegative capacity value and an associated length, together with nonempty supply intervals for the sources and nonempty demand intervals for the sinks. The Maximum Min-Cost-Flow P

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::acc5654e9541094f4786e4c55b0071e7
https://doi.org/10.1002/net.22060

Zobrazit plný text záznamu

The maximum diversity assortment selection problem

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

Publikováno v: Mathematical Methods of Operations Research. 93:521-554

In this article, we introduce the Maximum Diversity Assortment Selection Problem (MDASP), which is a generalization of the two-dimensional Knapsack Problem (2D-KP). Given a set of rectangles and a rectangular container, the goal of 2D-KP is to determ

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::14cb417d1fb837f2ca0b0a897ebb0c20
https://doi.org/10.1007/s00186-021-00740-2

Zobrazit plný text záznamu

Plný text ve formátu HTML

Optimal Operation of Transient Gas Transport Networks

Autor: Uwe Gotzes, Felix Hennings, Ralf Lenz, Nina Heinecke, Klaus Spreckelsen, Kai Hoppmann-Baum, Thorsten Koch

Publikováno v: Optimization and Engineering. 22:735-781

In this paper, we describe an algorithmic framework for the optimal operation of transient gas transport networks consisting of a hierarchical MILP formulation together with a sequential linear programming inspired post-processing routine. Its implem

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ffc473457d916d298cbf517da62ec854
https://doi.org/10.1007/s11081-020-09584-x

Zobrazit plný text záznamu

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

Autor: Uwe Gotzes, Kai Hoppmann

Publikováno v: Operational Research. 22:123-131

This article is mainly motivated by the urge to answer two kinds of questions regarding the Bundesliga, which is Germany’s primary football (soccer) division having the highest average stadium attendance worldwide: “At any point in the season, wh

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::733a450c02163e13434263af05e59697
https://doi.org/10.1007/s12351-020-00546-w

Zobrazit plný text záznamu

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

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

Publikováno v: Operations Research Proceedings 2021 ISBN: 9783031086229

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c318300bab2853e9857b03596b39eca8
https://doi.org/10.1007/978-3-031-08623-6_28

Zobrazit plný text záznamu

Controlling transient gas flow in real-world pipeline intersection areas

Autor: Kai Hoppmann-Baum, Mark Turner, Thorsten Koch, Lovis Anderson, Felix Hennings

Compressor stations are the heart of every high-pressure gas transport network. Located at intersection areas of the network, they are contained in huge complex plants, where they are in combination with valves and regulators responsible for routing

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b73b9c827fac259f5dfe5f1338302bc4

Zobrazit plný text záznamu

Minimum Cycle Partition with Length Requirements

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

Publikováno v: Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030589417
CPAIOR

In this article we introduce a Minimum Cycle Partition Problem with Length Requirements (CPLR). This generalization of the Travelling Salesman Problem (TSP) originates from routing Unmanned Aerial Vehicles (UAVs). Apart from nonnegative edge weights,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::6de7ad6ebb326f7c897f7dbb5d21be31
https://doi.org/10.1007/978-3-030-58942-4_18

Zobrazit plný text záznamu

Finding Maximum Minimum Cost Flows to Evaluate Gas Network Capacities

Autor: Kai Hoppmann, Robert Schwarz

Publikováno v: Operations Research Proceedings ISBN: 9783319899190
OR

In this article we consider the following problem arising in the context of scenario generation to evaluate the transport capacity of gas networks: In the Uncapacitated Maximum Minimum Cost Flow Problem (UMMCF) we are given a flow network where each

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bf4cb71eeb6b2f5790f26a56df66ea8e
https://doi.org/10.1007/978-3-319-89920-6_46

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání