✦ LIBER ✦

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

✍ Scribed by Markus Leitner; Günther R. Raidl

Book ID: 106390201
Publisher: Springer Netherlands
Year: 2011
Tongue: English
Weight: 538 KB
Volume: 10
Category: Article
ISSN: 1570-1166
DOI: 10.1007/s10852-011-9153-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Branch-and-Cut method for the Capacita

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

✍ José-Manuel Belenguer; Enrique Benavent; Christian Prins; Caroline Prodhon; Robe 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 296 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

A Branch-and-Cut-and-Price Approach for

A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem

✍ Edna Ayako Hoshino; Cid Carvalho de Souza 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A branch-and-cut algorithm for capacitat

A branch-and-cut algorithm for capacitated network design problems

✍ Oktay Günlük 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 173 KB

A computational evaluation of a general

A computational evaluation of a general branch-and-price framework for capacitated network location problems

✍ Alberto Ceselli; Federico Liberatore; Giovanni Righini 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 615 KB