We propose AllDiffPrec, a new global constraint that combines together an AllDifferent constraint with precedence constraints that strictly order given pairs of variables. We identify a number of applications for this global constraint including instruction scheduling and symmetry breaking. We give an efficient propagation algorithm that enforces bounds consistency on this global constraint. We show how to implement this propagator using a decomposition that extends the bounds consistency enforcing decomposition proposed for the AllDifferent constraint. Finally, we prove that enforcing domain consistency on this global constraint is NP-hard in general. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bessiere, C., Narodytska, N., Quimper, C. G., & Walsh, T. (2011). The allDifferent constraint with precedences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6697 LNCS, pp. 36–52). https://doi.org/10.1007/978-3-642-21311-3_6
Mendeley helps you to discover research relevant for your work.