✦ LIBER ✦

Improved lower bounds for the online bin packing problem with cardinality constraints

✍ Scribed by Fujiwara, Hiroshi; Kobayashi, Koji

Book ID: 121602729
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 356 KB
Volume: 29
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-013-9679-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Online Bin Packing with Cardinality Cons

Online Bin Packing with Cardinality Constraints

✍ Epstein, Leah 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 233 KB

Improved lower bounds for semi-online bi

Improved lower bounds for semi-online bin packing problems

✍ János Balogh; József Békési; Gábor Galambos; Mihály Csaba Markót 📂 Article 📅 2009 🏛 Springer Vienna 🌐 English ⚖ 151 KB

Lower Bound for the Online Bin Packing P

Lower Bound for the Online Bin Packing Problem with Restricted Repacking

✍ Balogh, János; Békési, József; Galambos, Gábor; Reinelt, Gerhard 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 192 KB

Ranking lower bounds for the bin-packing

Ranking lower bounds for the bin-packing problem

✍ Samir Elhedhli 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 320 KB

An improved lower bound for the bin pack

An improved lower bound for the bin packing problem

✍ Bintong Chen; Bharatendu Srivastava 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 870 KB

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