12 citations · 19 across the 18 of their papers we have counts for
5 papers · 1 filter
A Tight Formulation for the Dial-a-Ride Problem
Daniela Gaul, Kathrin Klamroth, Christian Pfeiffer +2
Ridepooling services play an increasingly important role in modern transportation systems. With soaring demand and growing fleet sizes, the underlying route planning problems becom…
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…
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…
A new perspective on dynamic network flow problems via port-Hamiltonian systems
Onur Tanil Doganay, Kathrin Klamroth, Bruno Lang +2
We suggest a global perspective on dynamic network flow problems that takes advantage of the similarities to port-Hamiltonian dynamics. Dynamic minimum cost flow problems are formu…
Ridepooling and public bus services: A comparative case-study
Hayk Asatryan, Daniela Gaul, Hanno Gottschalk +2
This case-study aims at a comparison of the service quality of time-tabled buses as compared to on-demand ridepooling cabs in the late evening hours in the city of Wuppertal, Germa…