✦ LIBER ✦

Online Bin Packing with Cardinality Constraints

✍ Scribed by Epstein, Leah

Book ID: 118196904
Publisher: Society for Industrial and Applied Mathematics
Year: 2006
Tongue: English
Weight: 233 KB
Volume: 20
Category: Article
ISSN: 0895-4801
DOI: 10.1137/050639065

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On online bin packing with LIB constrain

On online bin packing with LIB constraints

✍ Leah Epstein 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

## Abstract In many applications of packing, the location of small items below large items, inside the packed boxes, is forbidden. We consider a variant of the classic online one‐dimensional bin packing, in which items allocated to each bin are packed there in the order of arrival, satisfying the c

Algorithms for on-line bin-packing probl

Algorithms for on-line bin-packing problems with cardinality constraints

✍ Luitpold Babel; Bo Chen; Hans Kellerer; Vladimir Kotov 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Cardinality constrained bin‐packing prob

Cardinality constrained bin‐packing problems

✍ H. Kellerer; U. Pferschy 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 140 KB

Online bin packing with arbitrary releas

Online bin packing with arbitrary release times

✍ Yongqiang Shi; Deshi Ye 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 821 KB

Online variable-sized bin packing

✍ Nancy G. Kinnerseley; Michael A. Langston 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 438 KB

Variable Sized Bin Packing With Color Co

Variable Sized Bin Packing With Color Constraints

✍ Milind Dawande; Jayant Kalagnanam; Jay Sethuraman 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 275 KB