In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a certain value.
advertisement
Home → Magazine Archive → September 2010 (Vol. 53, No. 9) → Constraint Satisfaction Problems and Global Cardinality... → Abstract
Constraint Satisfaction Problems and Global Cardinality Constraints
By Andrei A. Bulatov, Dániel Marx
Communications of the ACM,
Vol. 53 No. 9, Pages 99-106
10.1145/1810891.1810914
![[article image]](https://cacm.acm.org/system/assets/0000/3656/082010_Codeproject.com_Constraint-Satisfaction.large.JPG?1476779405&1282239418 "The 8-Queen problem")
0 Comments
No entries found
Log in to Read the Full Article
Purchase the Article