Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem (Q439370)
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: Comparing branch-and-price algorithms for the multi-commodity k-splittable maximum flow problem |
scientific article; zbMATH DE number 6066782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem |
scientific article; zbMATH DE number 6066782 |
Statements
Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem (English)
0 references
16 August 2012
0 references
branch and bound
0 references
combinatorial optimization
0 references
multi-commodity flow
0 references
\(k\)-splittable
0 references
dantzig
0 references
Wolfe decomposition
0 references
heuristic
0 references
0 references
0.8789682984352112
0 references
0.8601585030555725
0 references
0.8535855412483215
0 references
0.8454704284667969
0 references
0.8274751901626587
0 references
