✦ LIBER ✦

A branch and cut algorithm for the VRP with satellite facilities

✍ Scribed by Jonathan F. Bard; Liu Huang; Moshe Dror; Patrick Jaillet

Book ID: 110250783
Publisher: Taylor and Francis Group
Year: 1998
Tongue: English
Weight: 177 KB
Volume: 30
Category: Article
ISSN: 0740-817X
DOI: 10.1023/a:1007500200749

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-cut algorithm for partition

A branch-and-cut algorithm for partition coloring

✍ Yuri Frota; Nelson Maculan; Thiago F. Noronha; Celso C. Ribeiro 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

A branch-and-cut algorithm for the Stein

A branch-and-cut algorithm for the Steiner tree problem with delays

✍ V. Leggieri, M. Haouari, C. Triki 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 284 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

A branch-and-cut algorithm for multiple

A branch-and-cut algorithm for multiple sequence alignment

✍ Ernst Althaus; Alberto Caprara; Hans-Peter Lenhof; Knut Reinert 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 519 KB