An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing |
scientific article; zbMATH DE number 7043518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing |
scientific article; zbMATH DE number 7043518 |
Statements
An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (English)
0 references
27 March 2019
0 references
polynomial time
0 references
network flow routing problem
0 references
bi-objective optimization
0 references
\(\epsilon\)-constraint technique
0 references
