✦ LIBER ✦

A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree

✍ Scribed by Tetsuo Asano; Naoki Katoh; Kazuhiro Kawashima

Book ID: 110302736
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 93 KB
Volume: 5
Category: Article
ISSN: 1382-6905
DOI: 10.1023/a:1011461300596

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

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

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

Approximation algorithms for a vehicle r

Approximation algorithms for a vehicle routing problem

✍ Sven O. Krumke; Sleman Saliba; Tjark Vredeveld; Stephan Westphal 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 403 KB

An exact algorithm for the asymmetrical

An exact algorithm for the asymmetrical capacitated vehicle routing problem

✍ Gilbert Laporte; Hélène Mercure; Yves Nobert 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

An exact algorithm for the asymmetrical

An exact algorithm for the asymmetrical capacitated vehicle routing problem

✍ Gilbert Laporte; Hélène Mercure; Yves Nobert 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

The aim of this article is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e., the multiple traveling salesman problem subject to capacity restrictions. The problem is solved by means of a branch and bound tree in which subproblems are modified assignment pr