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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics Jg. 376; S. 1 - 14
Hauptverfasser: Könen, David, Stiglmayr, Michael
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 15.12.2025
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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