Showing 2023Show all
2 papers · 1 filter
cs.CC2023
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…
math.OC2023
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…