3 papers
cs.DM2026
Representing the Non-dominated Set of Multi-objective Network Problems by Supported Non-dominated Points
David Könen, Lara Löhken, Michael Stiglmayr
In multi-objective combinatorial optimization, unsupported non-dominated points typically outnumber supported points and are often significantly more challenging to compute. Recent…
math.OC2026
Solving the Line-Based Dial-a-Ride Problem by Generating Stopping Patterns
Antonio Lauerbach, Sven Mallach, Kendra Reiter +2
In the line-based dial-a-ride problem (liDARP), vehicles operate along a predefined bus line, with the possibility of skipping stations and turning when empty. Motivated by the pra…
math.OC2025
On Supportedness in Multi-Objective Combinatorial Optimization
David Könen, Michael Stiglmayr
This paper addresses an inconsistency in various definitions of supported non-dominated points within multi-objective combinatorial problems (MOCO). MOCO problems are known to cont…