An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing |
scientific article |
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
