✦ LIBER ✦

A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint

✍ Scribed by Andrea Bettinelli; Alberto Ceselli; Giovanni Righini

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 492 KB
Volume: 179
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-008-0452-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-price algorithm for the two

A branch-and-price algorithm for the two-dimensional level strip packing problem

✍ Andrea Bettinelli; Alberto Ceselli; Giovanni Righini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 169 KB

A branch and price algorithm for the min

A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks

✍ R. Montemanni; V. Leggieri 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 190 KB

A branch-and-price algorithm for the cap

A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

✍ Christian H. Christiansen; Jens Lysgaard 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 164 KB

A Branch-and-Price Algorithm for the Cap

A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands

✍ Christian H. Christiansen; Jens Lysgaard; Sanne Wøhlk 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 966 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