A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint

In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and constraint propagation. Previous studies have demonstrated that designing special purpose constraint propagators for commonly occurring constraints can significantly improve the efficiency of a constraint programming approach. In this paper we present a fast, simple algorithm for bounds consistency propagation of the alldifferent constraint. The algorithm has the same worst case behavior as the previous best algorithm but is much faster in practice. Using a variety of benchmark and random problems, we show that our algorithm outperforms existing bounds consistency algorithms and also outperforms—on problems with an easily identifiable property—state-ofthe-art commercial implementations of propagators for stronger forms of local consistency.

• Type: Conference
• Year: 2003
• Where: IJCAI
• Authors: Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp, Peter van Beek
• Keywords: Bounds Consistency, Constraint Programming, IJCAI 2003, IJCAI 2007, Purpose Constraint Propagators