A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-009-0147-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966258309 / rank | |||
Normal rank | |||
Revision as of 20:49, 19 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
