J. L. Lauriere, A language and a program for stating and solving combinatorial problems, Artificial Intelligence, vol.10, issue.1, pp.29-127, 1978.
DOI : 10.1016/0004-3702(78)90029-2

J. C. Régin, A filtering algorithm for constraints of difference in CSPs, Proceedings of the 12th National Conference on AI, Association for Advancement of Artificial Intelligence, pp.362-367, 1994.

M. Leconte, A bounds-based reduction scheme for constraints of difference, Proceedings of Second International Workshop on Constraint-based Reasoning (Constraint-96, 1996.

J. Puget, A fast algorithm for the bound consistency of alldiff constraints, 15th National Conference on Artificial Intelligence, pp.359-366, 1998.

K. Mehlhorn and S. Thiel, Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint, Sixth International Conference on Principles and Practice of Constraint Programming, 2000.
DOI : 10.1007/3-540-45349-0_23

A. Lopez-ortiz, C. Quimper, J. Tromp, and P. Van-beek, A fast and simple algorithm for bounds consistency of the alldifferent constraint, Proceedings of the 18th International Conference on AI, International Joint Conference on Artificial Intelligence, 2003.

K. Stergiou and T. Walsh, The difference all-difference makes, Proceedings of 16th IJCAI, International Joint Conference on Artificial Intelligence, 1999.

M. Milano, G. Ottosson, P. Refalo, and E. Thorsteinsson, The Role of Integer Programming Techniques in Constraint Programming's Global Constraints, INFORMS Journal on Computing, vol.14, issue.4, pp.387-402, 2002.
DOI : 10.1287/ijoc.14.4.387.2830

H. Williams and H. Yan, Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming, INFORMS Journal on Computing, vol.13, issue.2, pp.96-103, 2001.
DOI : 10.1287/ijoc.13.2.96.10515

T. Walsh, Constraint Patterns, 9th International Conference on Principles and Practices of Constraint Programming, 2003.
DOI : 10.1007/978-3-540-45193-8_4

N. Beldiceanu and E. Bourreau, David Rivreau Helmut Simonis Solving Resource-constrained Project Scheduling Problems with CHIP, 5th International Workshop on Project Management and Scheduling (PMS'96), pp.35-38, 1996.

H. Simonis, Building Industrial Applications with Constraint Programming, Constraints in Computational Logics: Theory and Applications, International Summer School, CCL'99, 2001.
DOI : 10.1007/3-540-45406-3_6

R. Debruyne and C. Bessì-ere, Some practicable filtering techniques for the constraint satisfaction problem, Proceedings of the 15th IJCAI, International Joint Conference on Artificial Intelligence, pp.412-417, 1997.

M. Garey, D. Johnson, B. Simons, and R. Tarjan, Scheduling Unit???Time Tasks with Arbitrary Release Times and Deadlines, SIAM Journal on Computing, vol.10, issue.2, pp.256-269, 1981.
DOI : 10.1137/0210018

J. F. Puget, Breaking All Value Symmetries in Surjection Problems, Proceedings of 11th International Conference on Principles and Practice of Constraint Programming (CP2005), 2005.
DOI : 10.1007/11564751_37

J. F. Puget, Symmetry in injective problems, Constraint Programming Letters, vol.3, pp.1-20, 2007.

K. Mehlhorn and S. Thiel, Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint, CP '02: Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, pp.306-319, 2000.
DOI : 10.1007/3-540-45349-0_23

C. Bessiere, G. Katsirelos, N. Narodytska, C. G. Quimper, and T. Walsh, Decompositions of all different, global cardinality and related constraints, Proceedings of 21st IJCAI, International Joint Conference on Artificial Intelligence, pp.419-424, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00382607

C. Bessiere, G. Katsirelos, N. Narodytska, C. G. Quimper, and T. Walsh, Propagating conjunctions of alldifferent constraints, Proc. of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00873087

B. Hnich, Z. Kiziltan, and T. Walsh, Combining symmetry breaking with other constraints: lexicographic ordering with sums, Proceedings of the 8th International Symposium on the Artificial Intelligence and Mathematics, 2004.

G. Katsirelos, N. Narodytska, and T. Walsh, Combining Symmetry Breaking and Global Constraints, Recent Advances in Constraints, 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, pp.84-98, 2008.
DOI : 10.1007/11889205_64

H. Gabow and R. Tarjan, A linear-time algorithm for a special case of disjoint set union, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.246-251, 1983.
DOI : 10.1145/800061.808753