Article ID Journal Published Year Pages File Type
1143298 Operations Research Letters 2007 8 Pages PDF
Abstract

We propose a new exact method for the well-known two-dimensional bin-packing problem. It is based on an iterative decomposition of the set of items into two disjoint subsets. We tested the efficiency of our method against benchmarks of the literature. Computational experiments confirm the efficiency of our method.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A new exact method for the two-dimensional bin-packing problem with fixed orientation
Authors
, , ,