A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097)
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: A capacity scaling heuristic for the multicommodity capacitated network design problem |
scientific article; zbMATH DE number 5602686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A capacity scaling heuristic for the multicommodity capacitated network design problem |
scientific article; zbMATH DE number 5602686 |
Statements
A capacity scaling heuristic for the multicommodity capacitated network design problem (English)
0 references
10 September 2009
0 references
A capacity scaling heuristic using a column generation and row generation technique to address the multi-commodity capacitated network design problem is proposed. The capacity scaling heuristic is an approximate iterative solution method for capacitated network problems based on changing arc capacities, which depend on flow volumes on the arcs.
0 references
network optimization
0 references
capacity scaling
0 references
0 references
0 references
0 references
0.8568554520606995
0 references
0.825190007686615
0 references
0.8073704838752747
0 references
