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.

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 35; no. 3; pp. 365 - 373
Main Authors Clautiaux, François, Jouglet, Antoine, El Hayek, Joseph
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.05.2007
Elsevier
Subjects
Applied sciences
Computer Science
Exact sciences and technology
Flows in networks. Combinatorial problems
Lower bounds
Non-oriented bin-packing problem
Operational research and scientific management
Operational research. Management science
Operations Research
Lower bounds
Non-oriented bin-packing problem
Lower bound
Bin packing problem
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2006.07.001