𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved lower bounds for semi-online bin packing problems

✍ Scribed by János Balogh; József Békési; Gábor Galambos; Mihály Csaba Markót

Publisher
Springer Vienna
Year
2009
Tongue
English
Weight
151 KB
Volume
84
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new lower bound for the non-oriented t
A new lower bound for the non-oriented two-dimensional bin-packing problem
✍ François Clautiaux; Antoine Jouglet; Joseph El Hayek 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 183 KB

We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous results. Computational experiments show that the bounds are tight. We also discuss the case where the bin is not a square.