Bounds and heuristics for the shortest capacitated paths problem (Q1850995)
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: Bounds and heuristics for the shortest capacitated paths problem |
scientific article; zbMATH DE number 1845394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds and heuristics for the shortest capacitated paths problem |
scientific article; zbMATH DE number 1845394 |
Statements
Bounds and heuristics for the shortest capacitated paths problem (English)
0 references
15 December 2002
0 references
minimum cost integer multicommodity flow problem
0 references
bandwidth packing problem
0 references
Lagrangian relaxation
0 references
tabu search
0 references
0.95580095
0 references
0.9122615
0 references
0.9070184
0 references
0.89735734
0 references
0.89456624
0 references
0.8877321
0 references
0.8877119
0 references
0.88533604
0 references
0.8810704
0 references
