Dual Models of Permutation Problems
Principles and Practice of Constraint Programming - CP 2001, ed. Toby W
alsh,
pp. 615-619, Springer-Verlag, LNCS 2239, 2001.
Barbara M. Smith
Abstract
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 effects of combining both sets of variables in a single CSP are discussed.