A new exact method for the two-dimensional bin-packing problem with fixed orientation

Authors:
FrançOis Clautiaux;Jacques Carlier;Aziz Moukrim
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

Citing 9
Cited 1

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
The Three-Dimensional Bin Packing Problem

Operations Research
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

Computers and Operations Research
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

INFORMS Journal on Computing
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation

IEEE Transactions on Computers
An Exact Algorithm for Higher-Dimensional Orthogonal Packing

Operations Research
Bidimensional packing by bilinear programming

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

An Exact Algorithm for the Two-Dimensional Strip-Packing Problem

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.