Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem (Q439370): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem |
scientific article |
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
