𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch and cut algorithm for the container shipping network design problem

✍ Scribed by Reinhardt, Line Blander (author);Pisinger, David (author)

Book ID
113065805
Publisher
Springer US
Year
2011
Tongue
English
Weight
447 KB
Volume
24
Category
Article
ISSN
1936-6582

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-cut algorithm for solving a
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
✍ 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