✦ LIBER ✦

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

✍ Scribed by Lysgaard, Jens; Wøhlk, Sanne

Book ID: 120991835
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 617 KB
Volume: 236
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.08.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new branch-and-cut algorithm for the c

A new branch-and-cut algorithm for the capacitated vehicle routing problem

✍ Jens Lysgaard; Adam N. Letchford; Richard W. Eglese 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 203 KB

Robust Branch-and-Cut-and-Price for the

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

✍ Ricardo Fukasawa; Humberto Longo; Jens Lysgaard; Marcus Poggi de Aragão; Marcelo 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 335 KB

A Branch-and-Cut Algorithm for the Symme

A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem

✍ Jepsen, M.; Spoorendonk, S.; Ropke, S. 📂 Article 📅 2013 🏛 INFORMS 🌐 English ⚖ 275 KB

A branch and bound algorithm for the cap

A branch and bound algorithm for the capacitated vehicle routing problem

✍ G. Laporte; Y. Nobert 📂 Article 📅 1983 🏛 Springer 🌐 German ⚖ 643 KB

A branch-and-price algorithm for the cap

A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

✍ Christian H. Christiansen; Jens Lysgaard 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 164 KB

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