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

[article image]

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.

The full text of this article is premium content


No entries found