𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem

✍ Scribed by Solyalı, Oğuz; Süral, Haldun


Book ID
120249042
Publisher
INFORMS
Year
2011
Tongue
English
Weight
307 KB
Volume
45
Category
Article
ISSN
0041-1655

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