𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New classes of fast lower bounds for bin packing problems

✍ Scribed by Sándor P. Fekete; Jörg Schepers

Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
247 KB
Volume
91
Category
Article
ISSN
0025-5610

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.