An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems (Q6930358)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8093226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems |
scientific article; zbMATH DE number 8093226 |
Statements
An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems (English)
0 references
16 September 2025
0 references
minimum cost flow
0 references
multi-objective integer linear programming
0 references
multi-objective network flow
0 references
complexity theory
0 references
weakly supported
0 references
output-polynomial algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
