Conference Proceedings

Beyond finite domains: The all different and global cardinality constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3709 LNCS 812-816
DOI: 10.1007/11564751_70
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe how the propagator for the ALL-DIFFERENT constraint can be generalized to prune variables whose domains are not just simple finite integer domains. We show, for example, how it can be used to propagate set, multiset and tuple variables. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Quimper, C. G., & Walsh, T. (2005). Beyond finite domains: The all different and global cardinality constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 812–816). https://doi.org/10.1007/11564751_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free