𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Branch-and-Cut method for the Capacitated Location-Routing Problem

✍ Scribed by José-Manuel Belenguer; Enrique Benavent; Christian Prins; Caroline Prodhon; Roberto Wolfler Calvo


Book ID
108106998
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
296 KB
Volume
38
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Parallel branch and cut for capacitated
✍ T.K. Ralphs 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Combinatorial optimization problems arise commonly in logistics applications. The most successful approaches to date for solving such problems involve modeling them as integer programs and then applying some variant of the branch and bound algorithm. Although branch and bound is conceptually easy to