Combination of among and cardinality constraints

Authors:
Jean-Charles Régin
Affiliations:
Computing and Information Science, Cornell University, Ithaca, NY
Venue:
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2005

Citing 3
Cited 7

Data structures and network algorithms

Data structures and network algorithms
A generic arc-consistency algorithm and its specializations

Artificial Intelligence
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Flow-Based Propagators for the SEQUENCE and Related Global Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Generalizing Global Constraints Based on Network Flows

Recent Advances in Constraints
Constraint-Level Advice for Shaving

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
New filtering algorithms for combinations of among constraints

Constraints
Encodings of the SEQUENCE constraint

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The conjunction of interval among constraints

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Automated reencoding of boolean formulas

HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A cardinality constraint imposes that each value of a set V must be taken a certain number of times by a set of variables X, whereas an among constraint imposes that a certain number of variables of a set X must take a value in the set V. This paper studies several combinations of among constraints and several conjunctions of among constraints and cardinality constraints. Some filtering algorithms are proposed and they are characterized when it is possible. Moreover, a weak form of Singleton arc consistency is considered. At last, it is shown how the global sequencing constraint and the global minimum distance constraint can be easily modeled by some conjunctions of cardinality and among constraints. Some results are also given for the global minimum distance constraint. They show that our study outperforms the existing constraint in ILOG Solver.