multi-objective optimization 1network flow 1representation quality 1subset selection 1supported non-dominated points 1
From the 1 of 5 linked papers with an AI index.
Showing math.OCShow all
3 papers · 1 filter
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…
math.OC2025
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…