Article ID Journal Published Year Pages File Type
1143299 Operations Research Letters 2007 9 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A new lower bound for the non-oriented two-dimensional bin-packing problem
Authors
, , ,