|Start Page Number:||365|
|End Page Number:||373|
|Publication Date:||May 2007|
|Journal:||Operations Research Letters|
|Authors:||Jouglet Antoine, Clautiaux Franois, Hayek Joseph El|
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.