From the 1 of 5 linked papers with an AI index.
5 papers
Representing the Non-dominated Set of Multi-objective Network Problems by Supported Non-dominated Points
David Könen, Lara Löhken, Michael Stiglmayr
The paper investigates using supported (especially extreme) non‑dominated points to represent the Pareto set of multi‑objective capacitated network problems, showing they give high…
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…
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…
Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
David Könen, Michael Stiglmayr
This paper addresses the output-sensitive complexity for linear multi-objective integer minimum cost flow (MOIMCF) problems and provides insights about the time complexity for enum…
An Output-Polynomial Time Algorithm to Determine all Supported Efficient Solutions for Multi-Objective Integer Network Flow Problems
David Könen, Michael Stiglmayr
This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF). It derives an output-poly…