✦ LIBER ✦

An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand

✍ Scribed by Bartolini, Enrico; Cordeau, Jean-François; Laporte, Gilbert

Book ID: 120269816
Publisher: INFORMS
Year: 2013
Tongue: English
Weight: 234 KB
Volume: 61
Category: Article
ISSN: 0030-364X
DOI: 10.1287/opre.1120.1154

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Capacitated arc routing problem with dea

Capacitated arc routing problem with deadheading demands

✍ Gokhan Kirlik; Aydin Sipahioglu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Improved lower bounds and exact algorith

Improved lower bounds and exact algorithm for the capacitated arc routing problem

✍ Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 898 KB

BRKGA Algorithm for the Capacitated Arc

BRKGA Algorithm for the Capacitated Arc Routing Problem

✍ C. Martinez; I. Loiseau; M.G.C. Resende; S. Rodriguez 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 750 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

An exact algorithm for solving a capacit

An exact algorithm for solving a capacitated location-routing problem

✍ G. Laporte; Y. Nobert; D. Arpin 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 830 KB