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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operations research letters 2007-05, Vol.35 (3), p.365-373
Hauptverfasser:	Clautiaux, François, Jouglet, Antoine, El Hayek, Joseph
Format:	Artikel
Sprache:	eng
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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