A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:22, 5 March 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
