A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem (Q4530653)
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 Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem |
scientific article; zbMATH DE number 1749081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem |
scientific article; zbMATH DE number 1749081 |
Statements
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem (English)
0 references
4 June 2002
0 references
0.9045748114585876
0 references
0.8354063034057617
0 references
0.8352122902870178
0 references
