A new lower bound for the non-oriented two-dimensional bin-packing problem

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. © 2006 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2007
• Where: ORL
• Authors: François Clautiaux, Antoine Jouglet, Joseph El Hayek
• Keywords: Elsevier, Lower Bounds, Non-oriented Bin-packing Problem, ORL 2007