A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (Q319360)
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: A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem |
scientific article; zbMATH DE number 6633514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem |
scientific article; zbMATH DE number 6633514 |
Statements
A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (English)
0 references
6 October 2016
0 references
network flows
0 references
bi-objective multi-commodity minimum cost flow problem
0 references
Dantzig-Wolfe decomposition
0 references
column generation
0 references
bi-objective simplex method
0 references
0 references
0 references
0 references
0.8187750577926636
0 references
0.8181227445602417
0 references
0.816182017326355
0 references
0.812480092048645
0 references
0.8071910738945007
0 references
