The Alldifferent Constraint with Precedences - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2011

The Alldifferent Constraint with Precedences


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.
Fichier principal
Vignette du fichier
cpaior11.pdf (219.61 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00748652 , version 1 (05-11-2012)


  • HAL Id : lirmm-00748652 , version 1


Nina Narodytska, Christian Bessiere, Claude-Guy Quimper, Toby Walsh. The Alldifferent Constraint with Precedences. CPAIOR'11: International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, Berlin, Germany. pp.36-52. ⟨lirmm-00748652⟩
134 View
267 Download


Gmail Mastodon Facebook X LinkedIn More