𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semi-on-line bin packing: a short overview and a new lower bound

✍ Scribed by Balogh, János; Békési, József

Book ID
125352222
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
213 KB
Volume
21
Category
Article
ISSN
1435-246X

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.

A new version of on-line variable-sized
A new version of on-line variable-sized bin packing
✍ Guochuan Zhang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 304 KB

This paper investigates a new version of the on-line variable-sized bin packing problem. Suppose that bin capacities can vary. Given a list of items, the goal is to pack items in the bins which arrive in an on-line way such that the total size of bins used is minimized. It is shown that next fit and