✦ LIBER ✦

Lower Bound for the Online Bin Packing Problem with Restricted Repacking

✍ Scribed by Balogh, János; Békési, József; Galambos, Gábor; Reinelt, Gerhard

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved lower bounds for semi-online bi

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

An improved lower bound for the bin pack

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

Ranking lower bounds for the bin-packing

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

Lower bounds and reduction procedures fo

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 731 KB

New classes of fast lower bounds for bin

✍ Sándor P. Fekete; Jörg Schepers 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 247 KB

New lower bounds for the three-dimension

✍ Marco A. Boschetti 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 375 KB