Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Kai Hoppmann-Baum"'
Publikováno v:
Optimization Methods and Software. 37:2080-2116
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
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
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
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
https://doi.org/10.1007/978-3-031-08623-6_28
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