✦ LIBER ✦

k-Splittable delay constrained routing problem: A branch-and-price approach

✍ Scribed by Jérôme Truffot; Christophe Duhamel; Philippe Mahey

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 225 KB
Volume: 55
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20311

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A robust branch-cut-and-price algorithm

A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem

✍ Artur Pessoa; Eduardo Uchoa; Marcus Poggi de Aragão 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

A branch-and-price approach for the maxi

A branch-and-price approach for the maximum weight independent set problem

✍ Deepak Warrier; Wilbert E. Wilhelm; Jeffrey S. Warren; Illya V. Hicks 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

A branch-and-price-based large neighborh

A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

✍ Eric Prescott-Gagnon; Guy Desaulniers; Louis-Martin Rousseau 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance tr