Revisiting the Cardinality Reasoning for BinPacking Constraint

Abstract : In a previous work, we introduced a filtering for the Bin-Packing 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.
Type de document :
Communication dans un congrès
CP 2013, Sep 2013, Uppsala, Sweden. Principles and Practice of Constraint Programming - 19th International Conference, 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, 2013, <10.1007/978-3-642-40627-0_43>


https://hal.archives-ouvertes.fr/hal-01344076
Contributeur : Jean-Charles Regin <>
Soumis le : lundi 11 juillet 2016 - 12:25:30
Dernière modification le : mardi 19 juillet 2016 - 01:04:43

Fichier

cp13_binpackingcard.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

François Pelsser, Pierre Schaus, Jean-Charles Régin. Revisiting the Cardinality Reasoning for BinPacking Constraint. CP 2013, Sep 2013, Uppsala, Sweden. Principles and Practice of Constraint Programming - 19th International Conference, 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, 2013, <10.1007/978-3-642-40627-0_43>. <hal-01344076>

Partager

Métriques

Consultations de
la notice

16

Téléchargements du document

17