Principles and Practice of Constraint Programming — CP 2001

Volume 2239 of the series Lecture Notes in Computer Science pp 615-619


Dual Models of Permutation Problems

  • Smith Barbara M. Affiliated withSchool of Computing & Mathematics, University of Huddersfield

* Final gross prices may vary according to local VAT.

Get Access


A constraint satisfaction problem is a permutation problem if it has the same number of values as variables, all variables have the same domain and any solution assigns a permutation of the values to the variables. The dual CSP interchanges the variables and values;the efects of combining both sets of variables in a single CSP are discussed.