Artículo:

Constraint Satisfaction Problems and Global Cardinality Constraints

Autor:

Andrei A. Bulatov

Dániel Marx

Resumen:

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 …

Página:

99-106

Publicación:

Communications of the ACM

Volúmen:

53

Número:

9

Periodo:

Septiembre 2010

ISSN:

00010782

SrcID:

00010782-2010-09.txt