✦ LIBER ✦

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

✍ Scribed by Andrea Bettinelli; Alberto Ceselli; Giovanni Righini

Publisher: Springer
Year: 2007
Tongue: English
Weight: 169 KB
Volume: 6
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-007-0051-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the str

A branch and bound algorithm for the strip packing problem

✍ R. Alvarez-Valdes; F. Parreño; J. M. Tamarit 📂 Article 📅 2008 🏛 Springer 🌐 German ⚖ 370 KB

A branch-and-bound algorithm for the two

A branch-and-bound algorithm for the two-dimensional vector packing problem

✍ Frits C.R. Spieksma 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 661 KB

A branch-and-price algorithm for a targe

A branch-and-price algorithm for a targeting problem

✍ Ojeong Kwon; Kyungsik Lee; Donghan Kang; Sungsoo Park 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 1 views

A branch-and-price algorithm for the var

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

✍ Andrea Bettinelli; Alberto Ceselli; Giovanni Righini 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 492 KB

A branch-and-price algorithm for the cap

A branch-and-price algorithm for the capacitated p-median problem

✍ Alberto Ceselli; Giovanni Righini 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract The capacitated __p__‐median problem is the variation of the well‐known __p__‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We

Hybrid next-fit algorithm for the two-di

Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

✍ J. B. G. Frenk; G. Galambos 📂 Article 📅 1987 🏛 Springer Vienna 🌐 English ⚖ 686 KB