2 papers
cs.DM2024
On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
José Rui Figueira, Kathrin Klamroth, Michael Stiglmayr +1
Multi-objective unconstrained combinatorial optimization problems (MUCO) are in general hard to solve, i.e., the corresponding decision problem is NP-hard and the outcome set is in…
math.OC2024
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…