K. Ravindra, Ö. Ahuja, J. B. Ergun, A. P. Orlin, and . Punnen, A survey of very large-scale neighborhood search techniques, Discrete Applied Mathematics, vol.123, issue.1-3, pp.75-102, 2002.

C. Bessière, J. Régin, R. H. Yap, and Y. Zhang, An optimal coarse-grained arc consistency algorithm, Artificial Intelligence, vol.165, issue.2, pp.165-185, 2005.
DOI : 10.1016/j.artint.2005.02.004

E. D. Demaine and M. L. Demaine, Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity, Graphs and Combinatorics, vol.23, issue.S1, pp.195-208, 2007.
DOI : 10.1007/s00373-007-0713-4

P. Van-hentenryck and J. Carillon, Generality versus specificity : an experience with ai and or techniques, Proceedings of AAAI-88, 1988.

P. Refalo, Impact-Based Search Strategies for Constraint Programming, CP, pp.557-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41

J. Régin, A filtering algorithm for constraints of difference in csps, AAAI '94 : Proceedings of the twelfth national conference on Artificial intelligence, pp.362-367, 1994.

F. Rossi, P. Van-beek, and T. Walsh, Handbook of Constraint Programming (Foundations of Artificial Intelligence), 2006.

Y. Takenaga and T. Walsh, Tetravex is NP-complete, Information Processing Letters, vol.99, issue.5, pp.171-174, 2006.
DOI : 10.1016/j.ipl.2006.04.010