Bounds and heuristics for the shortest capacitated paths problem (Q1850995): 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.1023/a:1015492014030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1559267986 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds and heuristics for the shortest capacitated paths problem |
scientific article |
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
