M. S. Affane and H. Bennaceur, A weighted arcconsistency technique for Max-CSP, Proceedings of ECAI'98, pp.209-213, 1998.

R. J. Bayardo and D. P. Miranker, On the space-time trade-off in solving constraint satisfaction problems, Proceedings of IJCAI'95, pp.558-562, 1995.

C. Bessiere and J. Régin, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, Proceedings of CP'96, pp.61-75, 1996.
DOI : 10.1007/3-540-61551-2_66

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

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

M. C. 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

S. De-givry, F. Heras, M. Zytnicki, and J. Larrosa, Existential arc consistency : Getting closer to full arc consistency in weighted CSPs, Proceedings of IJ- CAI'05, pp.84-89, 2005.

S. De-givry, T. Schiex, and G. Verfaillie, Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP, Proceedings of AAAI'06, 2006.

E. C. Freuder and P. D. Hubbe, Using inferred disjunctive constraints to decompose constraint satisfaction problems, Proceedings of IJCAI'93, pp.254-261, 1993.

E. C. Freuder and M. J. Quinn, Taking advantage of stable sets of variables in constraint satisfaction problems, Proceedings of IJCAI'85, pp.1076-1078, 1985.

E. C. Freuder and R. J. Wallace, Partial constraint satisfaction, Proceedings of CP'05, pp.21-70, 1992.
DOI : 10.1016/0004-3702(92)90004-H

P. Jégou and C. Terrioux, Hybrid backtracking bounded by tree-decomposition of constraint networks, Artificial Intelligence, vol.146, issue.1, pp.43-75, 2003.
DOI : 10.1016/S0004-3702(02)00400-9

P. Jégou and C. Terrioux, Decomposition and Good Recording for Solving Max-CSPs, Proceedings of ECAI'04, pp.196-200, 2004.

J. Larrosa and R. Dechter, Boosting search with variable elimination in constraint optimization and constraint satisfaction problems, Constraints, vol.8, issue.3, pp.303-326, 2003.
DOI : 10.1023/A:1025627211942

J. Larrosa and P. Meseguer, Partition-Based Lower Bound for Max-CSP, Constraints, vol.7, pp.407-419, 2002.
DOI : 10.1007/978-3-540-48085-3_22

J. Larrosa, P. Meseguer, and T. Schiex, Maintaining reversible DAC for Max-CSP, Artificial Intelligence, vol.107, issue.1, pp.149-163, 1999.
DOI : 10.1016/S0004-3702(98)00108-8
URL : http://doi.org/10.1016/s0004-3702(98)00108-8

J. Larrosa and T. Schiex, In the quest of the best form of local consistency for Weighted CSP, Proceedings of IJCAI'03, pp.363-376, 2003.

R. Marinescu and R. Dechter, Advances in AND/OR Branch-and-Bound Search for Constraint Optimization, Proceedings of the CP'05 Workshop on Preferences and Soft Constraints, 2005.

R. Marinescu and R. Dechter, AND/OR Branch-and- Bound for Graphical Models, Proceedings of IJ- CAI'05, pp.224-229, 2005.

P. Meseguer and M. Sanchez, Specializing Russian Doll Search, Proceedings of CP'01, pp.464-478, 2001.
DOI : 10.1007/3-540-45578-7_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.584

J. C. Regin, T. Petit, C. Bessiere, and J. F. Puget, New lower bounds of constraint violations for overconstrained problems, Proceedings of CP'01, pp.332-345, 2001.

G. Verfaillie, M. Lemaitre, and T. Schiex, Russian doll search for solving constraint optimization problems, Proceedings of AAAI'96, pp.181-187, 1996.