4 papers
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…
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…
Finding all minimum cost flows and a faster algorithm for the K best flow problem
David Könen, Daniel R. Schmidt, Christiane Spisla
This paper addresses the problem of determining all optimal integer solutions of a linear integer network flow problem, which we call the all optimal integer flow (AOF) problem. We…