User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

Consistency Check for the Bin Packing Constraint Revisited

Primary tabs

download
  • Open access
  • PDF
  • 124.79 K
Dupuis, Julien [UCL] Schaus, Pierre [UCL] Deville, Yves [UCL]

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.

Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Access type Accès libre
Publication date 2010
Language Anglais
Conference "Integration of AI and OR Techniques in Constraint Programming for Cominatorial Optimization Problems. 7th International Conference, CPAIOR 2010", Bologna, Italy (14-18 June 2010)
Peer reviewed yes
Host document Lodi, A.; Milano, M.; Toth, P.; ; "Integration of AI and OR Techniques in Constraint Programming for Cominatorial Optimization Problems. 7th International Conference, CPAIOR 2010"- p. 117-122 (ISBN : 978-3-642-13519-4)
Publisher Springer
Affiliation UCL - SST/ICTM/INGI - Pôle en ingénierie informatique
Keywords 1160
Links
Bibliographic reference Dupuis, Julien ; Schaus, Pierre ; Deville, Yves. Consistency Check for the Bin Packing Constraint Revisited.Integration of AI and OR Techniques in Constraint Programming for Cominatorial Optimization Problems. 7th International Conference, CPAIOR 2010 (Bologna, Italy, 14-18 June 2010). In: Lodi, A.; Milano, M.; Toth, P.;, Integration of AI and OR Techniques in Constraint Programming for Cominatorial Optimization Problems. 7th International Conference, CPAIOR 2010, Springer2010, p. 117-122
Permanent URL http://hdl.handle.net/2078.1/67393