A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550)
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 fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem |
scientific article; zbMATH DE number 5664371
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem |
scientific article; zbMATH DE number 5664371 |
Statements
A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (English)
0 references
29 January 2010
0 references
\(k\)-splittable flow
0 references
heuristic
0 references
maximum concurrent flow
0 references
multicommodity
0 references
throughput
0 references
0 references
0 references
0 references
