𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound

✍ Scribed by Kaj Holmberg and Johan Hellstrand


Book ID
123709449
Publisher
INFORMS
Year
1998
Tongue
English
Weight
449 KB
Volume
46
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A branch-and-cut algorithm for solving a
✍ Lee, Youngho; Sherali, Hanif D.; Han, Junghee; Kim, Seong-in πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 133 KB πŸ‘ 2 views

In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical fiber technology. The problem is to find an optimal clustering of traffic demands in the network such that the total number of node assig