C. Cabon, S. De-givry, L. Lobjois, T. Schiex, and J. P. Warners, Radio Link Frequency Assignment, Constraints, vol.4, issue.1, pp.79-89, 1999.
DOI : 10.1023/A:1009812409930

M. Sanchez, S. De-givry, and T. Schiex, Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques, Constraints, vol.57, issue.4, pp.130-154, 2008.
DOI : 10.1007/s10601-007-9029-5

M. Cooper and T. Schiex, Arc consistency for soft constraints, Artificial Intelligence, vol.154, issue.1-2, pp.199-227, 2004.
DOI : 10.1016/j.artint.2003.09.002
URL : https://doi.org/10.1016/j.artint.2003.09.002

S. De-givry, F. Heras, J. Larrosa, and M. Zytnicki, Existential arc consistency: closer to full arc consistency in weighted CSPs, IJCAI, 2005.

M. C. Cooper, S. De-givry, and T. Schiex, Optimal Soft Arc Consistency, IJCAI, pp.68-73, 2007.

M. Cooper, S. Givry, M. Sanchez, T. Schiex, M. Zytnicki et al., Soft arc consistency revisited, Artificial Intelligence, vol.174, issue.7-8, pp.449-478, 2010.
DOI : 10.1016/j.artint.2010.02.001
URL : https://doi.org/10.1016/j.artint.2010.02.001

D. Allouche, S. De-givry, G. Katsirelos, T. Schiex, and M. Zytnicki, Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP, CP, pp.12-29, 2015.
DOI : 10.1007/978-3-319-23219-5_2
URL : https://hal.archives-ouvertes.fr/hal-01198361

N. Robertson and P. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4
URL : https://doi.org/10.1006/jctb.1996.0059

A. Koster, Frequency Assignment -Models and Algorithms, 1999.

C. Terrioux and P. Jégou, Bounded Backtracking for the Valued Constraint Satisfaction Problems, CP, pp.709-723, 2003.
DOI : 10.1007/978-3-540-45193-8_48

S. De-givry, T. Schiex, and G. Verfaillie, Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP, AAAI, pp.22-27, 2006.

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, ECAI, pp.146-150, 2004.

P. Refalo, Impact-Based Search Strategies for Constraint Programming, CP, pp.557-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41
URL : http://www.crt.umontreal.ca/~pesant/BIRS/pesant-IBS.pdf

S. Arnborg, D. Corneil, and A. Proskuroswki, -Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.
DOI : 10.1137/0608024

D. J. Rose, Triangulated graphs and the elimination process, Journal of Mathematical Analysis and Applications, vol.32, issue.3, pp.597-609, 1970.
DOI : 10.1016/0022-247X(70)90282-9
URL : https://doi.org/10.1016/0022-247x(70)90282-9

P. Jégou, H. Kanso, and C. Terrioux, An Algorithmic Framework for Decomposing Constraint Networks, 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp.1-8, 2015.
DOI : 10.1109/ICTAI.2015.15

P. Jégou and C. Terrioux, Combining Restarts, Nogoods and Decompositions for Solving CSPs, ECAI, pp.465-470, 2014.

P. Jégou, H. Kanso, and C. Terrioux, Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size, CP, 2016, pp.298-315
DOI : 10.1007/978-3-642-29828-8_15

P. Jégou and C. Terrioux, Tree-Decompositions with Connected Clusters for Solving Constraint Networks, CP, pp.407-423, 2014.
DOI : 10.1007/978-3-319-10428-7_31

M. C. Cooper, S. De-givry, M. Sánchez, T. Schiex, and M. Zytnicki, Virtual arc consistency for weighted csp, AAAI, pp.253-258, 2008.

S. De-givry, F. Heras, M. Zytnicki, and J. Larrosa, Existential arc consistency: Getting closer to full arc consistency in weighted csps, IJCAI, pp.84-89, 2005.

C. Lecoutre, L. Sa¨?ssa¨?s, S. Tabary, and V. Vidal, Reasoning from last conflict(s) in constraint programming, Artificial Intelligence, vol.173, issue.18, pp.1592-1614, 2009.
DOI : 10.1016/j.artint.2009.09.002
URL : https://hal.archives-ouvertes.fr/hal-00868108