An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems

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-polynomial time algorithm to determine all supported efficient solutions for MOIMCF problems. This is the first approach to...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 376; s. 1 - 14
Hlavní autori:	Könen, David, Stiglmayr, Michael
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.12.2025
Predmet:	Complexity theory Minimum cost flow Multi-objective integer linear programming Multi-objective network flow Output-polynomial algorithm Weakly supported Minimum cost flow Multi-objective network flow Weakly supported Complexity theory Multi-objective integer linear programming Output-polynomial algorithm
ISSN:	0166-218X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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-polynomial time algorithm to determine all supported efficient solutions for MOIMCF problems. This is the first approach to solve this general problem in output-polynomial time. Moreover, we prove that the existence of an output-polynomial time algorithm to determine all weakly supported nondominated vectors (or all weakly supported efficient solutions) for a MOIMCF problem with a fixed number of d≥3 objectives can be excluded unless P=NP.
ISSN:	0166-218X
DOI:	10.1016/j.dam.2025.06.001