C. Bessì-ere, A. Chmeiss, and L. Sa¨?ssa¨?s, Neighborhood-based variable ordering heuristics for the constraint satisfaction problem, CP. pp, pp.565-569, 2001.

C. Bessì-ere and J. C. Régin, MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems, CP. pp, pp.61-75, 1996.

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sa¨?ssa¨?s, Boosting systematic search by weighting constraints, ECAI. pp, pp.146-150, 2004.

D. Brélaz, New Methods to Color Vertices of a Graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979.

N. Eén and N. Sörensson, An Extensible SAT-solver, SAT. pp, pp.502-518, 2003.

P. A. Geelen, Dual viewpoint heuristics for binary constraint satisfaction problems, ECAI. pp, pp.31-35, 1992.

S. W. Golomb and L. D. Baumert, Backtrack programming, Journal of the ACM, vol.12, pp.516-524, 1965.

R. M. Haralick and G. L. Elliot, Increasing tree search efficiency for constraint satisfaction problems, AIJ, vol.14, pp.263-313, 1980.

E. Hebrard and M. Siala, Explanation-based weighted degree, CPAIOR. pp, pp.167-175, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01670307

P. Jégou, H. Kanso, and C. Terrioux, Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size, CP. pp, pp.298-315, 2016.

P. Jégou, H. Kanso, and . Terrioux, BTD and miniBTD. In: XCSP3 Competition, 2017.

P. Jégou and C. Terrioux, Hybrid backtracking bounded by tree-decomposition of constraint networks, AIJ, vol.146, pp.43-75, 2003.

C. Lecoutre, L. Sais, S. Tabary, and V. Vidal, Nogood recording from restarts, IJCAI. pp, pp.131-136, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00143825

C. Lecoutre, L. Sa¨?ssa¨?s, S. Tabary, and V. Vidal, Recording and Minimizing Nogoods from Restarts. JSAT, vol.1, issue.3-4, pp.147-167, 2007.

J. H. Liang, V. Ganesh, P. Poupart, and K. Czarnecki, Exponential Recency Weighted Average Branching Heuristic for SAT Solvers, AAAI. pp, pp.3434-3440, 2016.

J. H. Liang, V. Ganesh, P. Poupart, and K. Czarnecki, Learning Rate Based Branching Heuristic for SAT Solvers, SAT. pp, pp.123-140, 2016.

J. Marques-silva and K. A. Sakallah, Grasp: A search algorithm for propositional satisfiability, IEEE Transactions on Computers, vol.48, issue.5, pp.506-521, 1999.

L. Michel and P. V. Hentenryck, Activity-based search for black-box constraint programming solvers, CPAIOR. pp, pp.228-243, 2012.

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff: Engineering an Efficient SAT Solver, DAC. pp, pp.530-535, 2001.

P. Refalo, Impact-based search strategies for constraint programming, CP. pp, pp.557-571, 2004.

F. Rossi, P. Van-beek, and T. Walsh, Handbook of Constraint Programming, vol.2, 2006.

D. Sabin and E. C. Freuder, Contradicting Conventional Wisdom in Constraint Satisfaction. In: ECAI. pp, pp.125-129, 1994.

C. Schulte, Programming branchers, Modeling and Programming with Gecode, 2018.

R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction, 1998.