𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case

✍ Scribed by Marco A. Boschetti; Aristide Mingozzi

Publisher
Springer
Year
2003
Tongue
English
Weight
155 KB
Volume
1
Category
Article
ISSN
1619-4500

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.