✦ LIBER ✦

Multistars, partial multistars and the capacitated vehicle routing problem

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

Publisher: Springer-Verlag
Year: 2002
Tongue: English
Weight: 142 KB
Volume: 94
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-002-0336-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the capacitated vehicle routing probl

On the capacitated vehicle routing problem

✍ T.K. Ralphs; L. Kopman; W.R. Pulleyblank; L.E. Trotter 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 141 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

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

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