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

  • Authors:
  • FrançOis Clautiaux;Antoine Jouglet;Joseph El Hayek

  • Affiliations:
  • LIFL, UMR USTL/CNRS 8022, Bítiment M3, 59655 Villeneuve d'Ascq Cédex, France;HeuDiaSyC, UMR CNRS 6599, Université de Technologie de Compiègne, BP 20529, 60205 Compiègne, France;HeuDiaSyC, UMR CNRS 6599, Université de Technologie de Compiègne, BP 20529, 60205 Compiègne, France

  • Venue:
  • Operations Research Letters
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.