𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds and reduction procedures for the bin packing problem

✍ Scribed by Silvano Martello; Paolo Toth

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
731 KB
Volume
28
Category
Article
ISSN
0166-218X

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.