𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem

✍ Scribed by Bektaş, Tolga; Erdoğan, Güneş; Røpke, Stefan


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

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