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

Podrobná bibliografie

Vydáno v:	Discrete Applied Mathematics Ročník 376; s. 1 - 14
Hlavní autoři:	Könen, David, Stiglmayr, Michael
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 15.12.2025
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!