✦ LIBER ✦

A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

✍ Scribed by Cordeau, Jean-François

Book ID: 126887086
Publisher: INFORMS
Year: 2006
Tongue: English
Weight: 276 KB
Volume: 54
Category: Article
ISSN: 0030-364X
DOI: 10.1287/opre.1060.0283

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The dial-a-ride problem: models and algo

The dial-a-ride problem: models and algorithms

✍ Jean-François Cordeau; Gilbert Laporte 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 337 KB

A Granular Tabu Search algorithm for the

A Granular Tabu Search algorithm for the Dial-a-Ride Problem

✍ Kirchler, Dominik; Wolfler Calvo, Roberto 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 998 KB

A branch-and-cut algorithm for the Winne

A branch-and-cut algorithm for the Winner Determination Problem

✍ Laureano F. Escudero; Mercedes Landete; Alfredo Marín 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 616 KB

A branch-and-cut algorithm for the preem

A branch-and-cut algorithm for the preemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; G. Laporte 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determinin

A branch-and-cut algorithm for the nonpr

A branch-and-cut algorithm for the nonpreemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; Gilbert Laporte 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views

The Integrated Dial-a-Ride Problem

✍ Carl H. Häll; Henrik Andersson; Jan T. Lundgren; Peter Värbrand 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 573 KB