Propagating the bin packing constraint using linear programming

Authors:
Hadrien Cambazard;Barry O'Sullivan
Affiliations:
Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland;Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland
Venue:
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Year:
2010

Citing 4
Cited 3

Lower bounds and reduction procedures for the bin packing problem

Discrete Applied Mathematics - Combinatorial Optimization
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Computers and Operations Research
A Relaxation of the Cumulative Constraint

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Integrated Methods for Optimization (International Series in Operations Research & Management Science)

Integrated Methods for Optimization (International Series in Operations Research & Management Science)

Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location Problem

INFORMS Journal on Computing
Weibull-Based benchmarks for bin packing

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Cardinality reasoning for bin-packing constraint: application to a tank allocation problem

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow models, with the filtering of the bin packing constraint. Our experiments show that we often obtain significant improvements in runtime. The DP-flow model is a novel formulation of the problem.