Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound (Q2770085)
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: Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound |
scientific article |
Statements
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound (English)
0 references
7 February 2002
0 references
computational tests
0 references
network design
0 references
multicommodity minimal cost network flow
0 references
linear mixed-integer programming
0 references
transportation networks
0 references
Lagrangean heuristic
0 references
