F. Bacchus, S. Dalmao, and T. Pitassi, Value elimination: Bayesian inference via backtracking search, UAI-03, pp.20-28, 2003.

H. Bodlaender, Discovering treewidth, Theory and Practive of Computer Science -SOFSEM'2005, pp.1-16, 2005.

B. Cabon, S. De-givry, L. Lobjois, T. Schiex, and J. Warners, Radio link frequency assignment, Constraints, vol.4, pp.79-89, 1999.
URL : https://hal.archives-ouvertes.fr/hal-02695373

M. Cooper and T. Schiex, Arc consistency for soft constraints, Artificial Intelligence, vol.154, pp.199-227, 2004.

A. Darwiche, Recursive Conditioning. Artificial Intelligence, vol.126, issue.1-2, pp.5-41, 2001.

R. Dechter, Bucket elimination: A unifying framework for reasoning, Artificial Intelligence, vol.113, issue.1-2, pp.41-85, 1999.

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. Jegou and C. Terrioux, Decomposition and good recording, Proc. of ECAI-04, 0200.

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

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.

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

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-and-bound for graphical models, Proc. of IJCAI-05, pp.224-229, 2005.

T. Schiex, H. Fargier, and G. Verfaillie, Valued constraint satisfaction problems: hard and easy problems, Proc. of IJCAI-95, pp.631-637, 1995.
URL : https://hal.archives-ouvertes.fr/hal-02778456

R. Tarjan, Y. , and M. , Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs, SIAM J. Comput, vol.13, issue.3, pp.566-579, 1984.

C. Terrioux and P. Jegou, 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