✦ LIBER ✦

A Branch-and-Cut method for the Capacitated Location-Routing Problem

✍ Scribed by José-Manuel Belenguer; Enrique Benavent; Christian Prins; Caroline Prodhon; Roberto Wolfler Calvo

Book ID: 108106998
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 296 KB
Volume: 38
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2010.09.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Parallel branch and cut for capacitated

Parallel branch and cut for capacitated vehicle routing

✍ T.K. Ralphs 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Combinatorial optimization problems arise commonly in logistics applications. The most successful approaches to date for solving such problems involve modeling them as integer programs and then applying some variant of the branch and bound algorithm. Although branch and bound is conceptually easy to

Branch-and-Cut-and-Price for Capacitated

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

✍ Markus Leitner; Günther R. Raidl 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 538 KB

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

A GRASP×ELS approach for the capacitated

A GRASP×ELS approach for the capacitated location-routing problem

✍ Christophe Duhamel; Philippe Lacomme; Christian Prins; Caroline Prodhon 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 412 KB