Consistency Check for the Bin Packing Constraint Revisited

Dupuis, Julien;Schaus, Pierre;Deville, Yves
(2010) Integration of AI and OR Techniques in Constraint Programming for Cominatorial Optimization Problems. 7th International Conference, CPAIOR 2010 — Location: Bologna, Italy (14.June.2010)

Files

consistency.pdf
  • Open Access
  • Adobe PDF
  • 124.79 KB
Download

Details

Authors
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. This problem can be solved in Constraint Programming (CP) by introducing one placement variable x iota for each item and one load variable lj for each bin. This work focuses on improvements of the failure detection algorithm.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Dupuis, J., Schaus, P., & Deville, Y. (2010). Consistency Check for the Bin Packing Constraint Revisited. In Lodi, A.; Milano, M.; Toth, P.; (ed.), Integration of AI and OR Techniques in Constraint Programming for Cominatorial Optimization Problems. 7th International Conference, CPAIOR 2010 (p. p. 117-122). Springer. https://doi.org/10.1007/978-3-642-13520-0_15