D. Achlioptas, L. Kirousis, E. Kranakis, D. Krizanc, M. Molloy et al., Random constraint satisfaction: A more accurate picture, Proceedings CP 1997, pp.121-135, 1997.
DOI : 10.1007/BFb0017433

J. F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol.38, issue.1, pp.238-252, 1962.
DOI : 10.1007/BF01386316

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

H. Cambazard, P. Hladik, A. Déplanche, N. Jussien, and Y. Trinquet, Decomposition and Learning for a Hard Real Time Task Allocation Problem, Proceedings CP 2004, pp.153-167, 2004.
DOI : 10.1007/978-3-540-30201-8_14

G. Cleuziou, L. Martin, and C. Vrain, Disjunctive Learning with a Soft-Clustering Method, ILP'03 :13th International Conference on Inductive Logic Programming, pp.75-92, 2003.
DOI : 10.1007/978-3-540-39917-9_7
URL : https://hal.archives-ouvertes.fr/hal-00085007

C. Bessière, A. Chmeiss, and L. Saïs, Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem, Proceeding CP'01, pp.565-569, 2001.
DOI : 10.1007/3-540-45578-7_40

M. Ghoniem, N. Jussien, and J. Fekete, VISEXP : visualizing constraint solver dynamics using explanations, Proceedings FLAIRS'04, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00869112

C. P. Gomes, B. Selman, and N. Crato, Heavy-tailed distributions in combinatorial search, Proceeding CP 97, pp.121-135, 1997.
DOI : 10.1007/BFb0017434

R. Haralick and G. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

J. N. Hooker and G. Ottosson, Logic-based benders decomposition, Mathematical Programming, pp.33-60, 2003.

V. Jain and I. E. Grossmann, Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems, INFORMS Journal on Computing, vol.13, issue.4, pp.258-276, 2001.
DOI : 10.1287/ijoc.13.4.258.9733

N. Jussien, The versatility of using explanations within constraint programming, 2003.
URL : https://hal.archives-ouvertes.fr/tel-00293905

N. Jussien and V. Barichard, The PaLM system : explanation-based constraint programming, Proceedings of TRICS : Techniques foR Implementing Constraint programming Systems, pp.118-133, 2000.

N. Jussien, R. Debruyne, and P. Boizumault, Maintaining Arc-Consistency within Dynamic Backtracking, Proceedings CP 2000, pp.249-261, 2000.
DOI : 10.1007/3-540-45349-0_19
URL : https://hal.archives-ouvertes.fr/hal-00869126

N. Jussien and O. Lhomme, Local search with constraint propagation and??conflict-based heuristics, Artificial Intelligence, vol.139, issue.1, pp.21-45, 2002.
DOI : 10.1016/S0004-3702(02)00221-7
URL : https://hal.archives-ouvertes.fr/hal-00869124

P. Prosser, K. Stergiou, and T. Walsh, Singleton Consistencies, Proceedings CP 2000, pp.353-368, 2000.
DOI : 10.1007/3-540-45349-0_26

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

R. Williams, C. Gomes, and B. Selman, On the connections between backdoors and heavy-tails on combinatorial search Backdoors to typical case complexity, the International Conference on Theory and Applications of Satisfiability Testing (SAT) Proceedings IJCAI 2003, 2003.

A. M. Geoffrion, Generalized Benders decomposition, Journal of Optimization Theory and Applications, vol.10, issue.4, 1972.
DOI : 10.1007/BF00934810
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=AD0708878