12 citations · 19 across the 18 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
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★ 1 cited
The Line-Based Dial-a-Ride Problem
Kendra Reiter, Marie Schmidt, Michael Stiglmayr
On-demand ridepooling systems offer flexible services pooling multiple passengers into one vehicle, complementing traditional bus services. We propose a transportation system combi…