Dual Models of Permutation Problems

  • Smith Barbara M. 
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)

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 efects of combining both sets of variables in a single CSP are discussed.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Smith Barbara M. 
    • 1
  1. 1.School of Computing & MathematicsUniversity of HuddersfieldHuddersfieldUK

Personalised recommendations