Showing math.OCShow all
2 papers · 1 filter
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…