✦ LIBER ✦

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

✍ Scribed by Jens Lysgaard; Adam N. Letchford; Richard W. Eglese

Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 203 KB
Volume: 100
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-003-0481-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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-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

A robust branch-cut-and-price algorithm

A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem

✍ Artur Pessoa; Eduardo Uchoa; Marcus Poggi de Aragão 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

EVE-OPT: a hybrid algorithm for the capa

EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem

✍ Guido Perboli; Ferdinando Pezzella; Roberto Tadei 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 420 KB