A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem (Q2448170)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6290456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem |
scientific article; zbMATH DE number 6290456 |
Statements
A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem (English)
0 references
30 April 2014
0 references
\(k\)-splittable flow
0 references
multi-commodity flow
0 references
local search heuristic
0 references
meta-heuristic
0 references
shortest path
0 references
0 references
0 references
0.8789682984352112
0 references
0.872004508972168
0 references
0.830385148525238
0 references
0.8280656933784485
0 references
