A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:25, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem |
scientific article |
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