Revisiting the cardinality reasoning for BinPacking constraint

Pelsser, François;Schaus, Pierre;Regin, Jean-Charles
(2013) 19th International Conference — Location: Uppsala, Sweden (16.September.2013)

Files

cp13_binpackingcard.pdf
  • Restricted Access
  • Adobe PDF
  • 276.98 KB
Request a copy

Details

Authors
  • Pelsser, FrançoisUCLouvain
    Author
  • Schaus, Pierreorcid-logoUCLouvain
    Author
  • Regin, Jean-CharlesUniversity of Nice-Sophia Antipolis, France
    Author
Abstract
In a previous work, we introduced a filtering for the BinPacking constraint based on a cardinality reasoning for each bin combined with a global cardinality constraint. We improve this filtering with an algorithm providing tighter bounds on the cardinality variables. We experiment it on the Balanced Academic Curriculum Problems demonstrating the benefits of the cardinality reasoning for such bin-packing problems.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Pelsser, F., Schaus, P., & Regin, J.-C. (2013). Revisiting the cardinality reasoning for BinPacking constraint. Principles and Practice of Constraint Programming, p. 578-586. https://doi.org/10.1007/978-3-642-40627-0_43