✦ LIBER ✦

The Capacitated Arc Routing Problem: Valid Inequalities and Facets

✍ Scribed by J.M. Belenguer; E. Benavent

Book ID: 110368886
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 191 KB
Volume: 10
Category: Article
ISSN: 0926-6003
DOI: 10.1023/a:1018316919294

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Valid inequalities and facets of the cap

Valid inequalities and facets of the capacitated plant location problem

✍ Janny M. Y. Leung; Thomas L. Magnanti 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 911 KB

The generalized assignment problem: Vali

The generalized assignment problem: Valid inequalities and facets

✍ Elsie Sterbin Gottlieb; M. R. Rao 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 944 KB

The capacitated arc routing problem with

The capacitated arc routing problem with intermediate facilities

✍ Gianpaolo Ghiani; Gennaro Improta; Gilbert Laporte 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

Heuristics for the periodic capacitated

Heuristics for the periodic capacitated arc routing problem

✍ Feng Chu; Nacima Labadi; Christian Prins 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 372 KB

The capacitated arc routing problem with

The capacitated arc routing problem with refill points

✍ Alberto Amaya; André Langevin; Martin Trépanier 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 174 KB

This article introduces the capacitated arc routing problem with refill points (CARP-RP). The vehicle servicing arcs must be refilled on the spot by using a second vehicle. The problem consists on simultaneously determining the vehicles routes that minimize the total cost. An integer linear programm

New lower bounds for the Capacitated Arc

New lower bounds for the Capacitated Arc Routing Problem

✍ Wen Lea Pearn 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB