Showing math.OCShow all
3 papers · 1 filter
math.OC2023
Adapting Branching and Queuing for Multi-objective Branch and Bound
Julius Bauß, Michael Stiglmayr
Branch and bound algorithms have to cope with several additional difficulties in the multi-objective case. Not only the bounding procedure is considerably weaker, but also the hand…
math.OC2023
On the online path extension problem -- Location and routing problems in board games
Konstantin Kraus, Kathrin Klamroth, Michael Stiglmayr
We consider an online version of a longest path problem in an undirected and planar graph that is motivated by a location and routing problem occurring in the board game "Turn & Ta…
math.OC2023
Modeling Minimum Cost Network Flows With Port-Hamiltonian Systems
Onur Tanil Doganay, Kathrin Klamroth, Bruno Lang +2
We give a short overview of advantages and drawbacks of the classical formulation of minimum cost network flow problems and solution techniques, to motivate a reformulation of clas…