F. Bacchus, S. Dalmao, and T. Pitassi, Value elimination: Bayesian inference via backtracking search

H. Bodlaender, Discovering Treewidth, Theory and Practive of Computer Science -SOFSEM'2005, pp.1-16, 2005.
DOI : 10.1007/978-3-540-30577-4_1

B. 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. 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

M. C. Cooper, Reduction operations in fuzzy or valued constraint satisfaction, Fuzzy Sets and Systems, vol.134, issue.3, pp.311-342, 2003.
DOI : 10.1016/S0165-0114(02)00134-3

A. Darwiche, Recursive conditioning, Artificial Intelligence, vol.126, issue.1-2, pp.5-41, 2001.
DOI : 10.1016/S0004-3702(00)00069-2

S. De-givry, J. Larrosa, P. Meseguer, and T. Schiex, Solving Max-SAT as Weighted CSP, Proc. of CP- 03, pp.363-376, 2003.
DOI : 10.1007/978-3-540-45193-8_25

S. De-givry, I. Palhiere, Z. Vitezica, and T. Schiex, Mendelian error detection in complex pedigree using weighted constraint satisfaction techniques, ICLP- 05 workshop on Constraint Based Methods for Bioinformatics, 2005.

S. De-givry, T. Schiex, and G. Verfaillie, Combining tree decomposition and local consistency in maxcsps, CP-2005 workshop on Preferences and Soft Constraints, 2005.

S. De-givry, G. Verfaillie, and T. Schiex, Bounding the optimum of constraint optimization problems
DOI : 10.1007/BFb0017456

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

R. Dechter, Bucket elimination: A unifying framework for reasoning, Artificial Intelligence, vol.113, issue.1-2, pp.41-85, 1999.
DOI : 10.1016/S0004-3702(99)00059-4
URL : http://doi.org/10.1016/s0004-3702(99)00059-4

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

P. Jégou and C. Terrioux, Decomposition and good recording, Proc. of ECAI-04, pp.196-200, 2004.

A. Koster, Frequency assignment: Models and Algorithms, 1999.

J. Larrosa, On arc and node consistency in weighted CSP, Proc. AAAI-02, pp.48-53, 2002.

J. Larrosa and P. Meseguer, Phase transition in maxcsp, Proc. of ECAI-96, pp.190-194, 1996.

J. Larrosa, P. Meseguer, and M. Sanchez, Pseudotree search with soft constraints, Proc. of ECAI-02, pp.131-135, 2002.

J. Larrosa and T. Schiex, In the quest of the best form of local consistency for weighted CSP, Proc. of IJCAI-03, pp.239-244, 2003.

J. Larrosa and T. Schiex, Solving weighted CSP by maintaining arc consistency, Artificial Intelligence, vol.159, issue.1-2, pp.1-26, 2004.
DOI : 10.1016/j.artint.2004.05.004
URL : http://doi.org/10.1016/j.artint.2004.05.004

R. Marinescu and R. Dechter, Advances in and/or branch-and-bound search for constraint optimization, CP-2005 workshop on Preferences and Soft Constraints, 2005.

R. Marinescu and R. Dechter, And/or branch-andbound for graphical models, Proc. of IJCAI-05, pp.224-229, 2005.

T. Sandholm, Algorithm for optimal winner determination in combinatorial auctions, Proc. of IJCAI-99, pp.542-547, 1999.
DOI : 10.1016/S0004-3702(01)00159-X
URL : http://doi.org/10.1016/s0004-3702(01)00159-x

T. Schiex, Arc Consistency for Soft Constraints, Proc. of CP-00, pp.411-424, 2000.
DOI : 10.1007/3-540-45349-0_30
URL : http://arxiv.org/abs/cs/0111038

T. Schiex, H. Fargier, and G. Verfaillie, Valued constraint satisfaction problems: hard and easy problems, Proc. of IJCAI-95, pp.631-637, 1995.

D. Strickland, E. Barnes, and J. Sokol, Optimal Protein Structure Alignment Using Maximum Cliques, Operations Research, vol.53, issue.3, pp.389-402, 2005.
DOI : 10.1287/opre.1040.0189

R. Tarjan and M. Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.
DOI : 10.1137/0213035

C. Terrioux and P. Jégou, Hybrid backtracking bounded by tree-decomposition of constraint networks, Artificial Intelligence, vol.146, issue.1, pp.43-75, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01479594