The AllDifferent Constraint with Precedences

Select |




Print


Bessiere, Christian; Narodytska, Nina; Quimper, Claude-Guy; Walsh, Toby


2011-05-16


Conference Material


8th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems


BERLIN


36-52


We propose AllDiffPrecedence, 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.


Springer


http://cpaior2011.zib.de/site/make.php?event=cpaior2011


nicta:4759


Bessiere, Christian; Narodytska, Nina; Quimper, Claude-Guy; Walsh, Toby. The AllDifferent Constraint with Precedences. In: 8th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems; BERLIN. Springer; 2011-05-16. 36-52.http://hdl.handle.net/102.100.100/104366?index=1



Loading citation data...

Citation counts
(Requires subscription to view)