Consistency check for the bin packing constraint revisited

Authors:
Julien Dupuis;Pierre Schaus;Yves Deville
Affiliations:
Department of Computer Science and Engineering, UCLouvain, Belgium;Dynadec Europe, Belgium;Department of Computer Science and Engineering, UCLouvain, Belgium
Venue:
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2010

Citing 3
Cited 2

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
An analysis of lower bound procedures for the bin packing problem

Computers and Operations Research

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 bin packing problem (BP) consists in finding the minimum number of bins necessary to pack a set of items so that the total size of the items in each bin does not exceed the bin capacity C. The bin capacity is common for all the bins.