𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

✍ Scribed by Ricardo Fukasawa; Humberto Longo; Jens Lysgaard; Marcus Poggi de Aragão; Marcelo Reis; Eduardo Uchoa; Renato F. Werneck

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
335 KB
Volume
106
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel branch and cut for capacitated
Parallel branch and cut for capacitated vehicle routing
✍ 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