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 the normal view instead:
scientific article; zbMATH DE number 1702796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound |
scientific article; zbMATH DE number 1702796 |
Statements
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
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound (English)
0 references
0.9045748114585876
0 references
0.814480185508728
0 references
0.8102707266807556
0 references
