L. Gouveia and S. Voß, A classification of formulations for the (time-dependent) traveling salesman problem, vol.83, pp.69-82, 1995.

, LLC Gurobi Optimization : Gurobi optimizer reference manual, 2018.

W. D. Harvey and M. L. Ginsberg, Limited discrepancy search, IJCAI, 1995.

M. Held and R. M. Karp, A dynamic programming approach to sequencing problems, Proceedings of the 1961 16th ACM National Meeting, ACM, vol.204, pp.71-201, 1961.
DOI : 10.1145/800029.808532

S. Ichoua, M. Gendreau, and J. Potvin, Vehicle dispatching with time-dependent travel times. EJOR, vol.144, pp.379-396, 2003.
DOI : 10.1016/s0377-2217(02)00147-9

D. E. Kaufman and R. L. Smith, Fastest paths in timedependent networks for intelligent vehicle-highway systems application, Journal of Intelligent Transportation Systems, vol.1, pp.1-11, 1993.

J. A. Laval and L. Leclercq, Microscopic modeling of the relaxation phenomenon using a macroscopic lane-changing model, Transportation Research Part B : Methodological, vol.42, issue.6, pp.511-522, 2008.

L. Leclercq, Bounded acceleration close to fixed and moving bottlenecks, Transportation Research Part B : Methodological, vol.41, issue.3, pp.309-319, 2007.
DOI : 10.1016/j.trb.2006.05.001

L. Leclercq, N. Chiabaut, and B. Trinquier, Macroscopic fundamental diagrams : A cross-comparison of estimation methods, Transportation Research Part B : Methodological, vol.62, pp.1-12, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01349913

C. Malandraki and M. S. Daskin, Time dependent vehicle routing problems : Formulations, properties and heuristic algorithms, Transportation Science, vol.26, issue.3, pp.185-200, 1992.
DOI : 10.1287/trsc.26.3.185

C. Malandraki and R. B. , Dial : A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, vol.90, pp.45-55, 1996.

P. Melgarejo and P. Laborie, Solnon : A timedependent no-overlap constraint : Application to urban delivery problems, CPAIOR, volume 9075 de LNCS, pp.1-17, 2015.

A. Montero, I. Méndez-díaz, and J. Miranda, Bront : An integer programming approach for the time-dependent traveling salesman problem with time windows, Computers & Operations Research, vol.88, pp.280-289, 2017.

G. Newell, A simplified car-following theory : a lower order model, Transportation Research Part B : Methodological, vol.36, issue.3, pp.195-205, 2002.

R. Stan?k and U. Pferschy, Generating subtour elimination constraints for the tsp from pure integer solutions, Central European journal of operations research, vol.25, pp.231-260, 2017.

R. Roberti and P. Toth, Models and algorithms for the asymmetric traveling salesman problem : an experimental comparison, EURO J. Transportation and Logistics, vol.1, issue.1-2, pp.113-133, 2012.

J. Salotti, S. Fenet, R. Billot, and N. , El Faouzi et C. Solnon : Comparison of traffic forecasting methods in urban and suburban context, 2018.

J. Schneider, The time-dependent traveling salesman problem, Physica A : Statistical Mechanics and its Applications, vol.314, issue.1, pp.151-155, 2002.

G. Stecco, J. Cordeau, and E. Moretti, A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine, J. Scheduling, vol.12, issue.1, pp.3-16, 2009.

D. Vu, M. Hewitt, N. Boland, and M. Savelsbergh, Solving time dependent traveling salesman problems with time windows, 2018.

S. Banik, A. Bogdanov, T. Isobe, K. Shibutani, H. Hiwatari et al., Midori : A block cipher for low energy, ASIACRYPT, volume 9453 de LNCS, pp.411-436, 2015.

A. Biere, Yet another local search solver and lingeling and friends entering the sat competition, vol.01, pp.39-40, 2014.

E. Biham, New types of cryptoanalytic attacks using related keys (extended abstract), EUROCRYPT, vol.765, pp.398-409, 1993.

E. Biham and A. Shamir, Differential cryptoanalysis of feal and n-hash, EUROCRYPT, volume 547 de LNCS, pp.1-16, 1991.

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

C. Cid, T. Huang, T. Peyrin, Y. Sasaki, and L. Song, Boomerang connectivity table : A new cryptanalysis tool, pp.683-714, 2018.

H. Comon-lundh and V. Shmatikov, Intruder deductions, constraint solving and insecurity decision in presence of exclusive or, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings, pp.271-280, 2003.

, Advanced Encryption Standard. Federal Information Processing Standards Publication, vol.197, 2001.

D. Gérault, Security Analysis of Contactless Communication Protocols, 2018.

D. Gérault, P. Lafourcade, and M. Minier, Solnon : Revisiting AES related-key differential attacks with constraint programming, Inf. Process. Lett, vol.139, pp.24-29, 2018.

D. Gérault, M. Minier, and C. Solnon, Constraint programming models for chosen key differential cryptanalysis, CP, volume 9892 de LNCS, pp.584-601

. Springer, , 2016.

R. M. Karp, Reducibility among combinatorial problems, In Symposium on the Complexity of Computer Computations, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

L. Knudsen, Truncated and higher order differentials, Fast Software Encryption, pp.196-211, 1995.

D. E. Knuth, Dancing links. Millenial Perspectives in Computer Science, vol.18, p.4, 2000.

T. Laitinen, T. Junttila, and I. Niemelä, Conflict-Driven XOR-Clause Learning (extended version), 2014.

C. Prud'homme, J. Fages, and X. Lorca, , 2016.

Y. Todo, T. Isobe, Y. Hao, and W. Meier, Cube attacks on non-blackbox polynomials based on division property, CRYPTO, volume 10403 de LNCS, pp.250-279, 2017.

N. Zhou, H. Kjellerstrand, and J. Fruhman, Constraint Solving and Planning with Picat, 2015.

N. Zhou and H. Kjellerstrand, Optimizing SAT encodings for arithmetic constraints

O. Akgun, A. Frisch, I. Gent, B. Hussain, C. Jefferson et al., Automated symmetry breaking and model selection in Conjure, Proceedings of CP'13, pp.107-116, 2013.

C. Bessiere, P. Meseguer, E. C. Freuder, and J. Larrosa, On Forward Checking for non-binary constraint satisfaction, Artificial Intelligence, vol.141, pp.205-224, 2002.
URL : https://hal.archives-ouvertes.fr/lirmm-00268449

F. Boussemart, C. Lecoutre, G. Audemard, and C. Piette, XCSP3 : an integrated format for benchmarking combinatorial constrained problems, 2016.

A. Frisch, M. Grum, C. Jefferson, and B. , Martinez Hernandez et I. Miguel : The design of ESSENCE : A constraint language for specifying combinatorial problems, Proceedings of IJCAI'07, pp.80-87, 2007.

E. Hebrard, E. O'mahony, and B. O'sullivan, Constraint programming and combinatorial optimisation in Numberjack, Proceedings of CPAIOR'10, pp.181-185, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00561698

B. Hnich, Z. Kiziltan, and T. Walsh, CSPLib Problem 030 : Balanced academic curriculum problem

H. Hoos, CSPLib Problem 007 : All-interval series

C. Jefferson, I. Miguel, B. Hnich, T. Walsh, and I. Gent, CSPLib : A problem library for constraints, 1999.

C. Lecoutre, MCSP3 : Easy modeling for everybody. Rapport technique, CRIL, 2018.

W. Ahrendt, B. Beckert, R. Bubel, R. Hähnle, H. Peter et al., Deductive Software Verification-The KeY Book : From Theory to Practice, vol.10001, 2016.

. Özgür-akgün, P. Ian, C. Gent, I. Jefferson, . Miguel et al., Metamorphic testing of constraint solvers, International Conference on Principles and Practice of Constraint Programming, pp.727-736, 2018.

C. Artho, A. Biere, and M. Seidl, Model-based testing for verification back-ends, International Conference on Tests and Proofs, pp.39-55, 2013.

J. Barnes, SPARK : The Proven Approach to High Integrity Software. Altran Praxis, 2012.

K. Beck and E. Gamma, Test infected : Programmers love writing tests, vol.3, pp.37-50, 1998.

N. Beldiceanu, M. Carlsson, and . Jeanxavier-rampon, Global constraint catalog, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00485396

, Christian Bessiere : Constraint propagation, Foundations of Artificial Intelligence, vol.2, pp.29-83, 2006.

C. Beust and A. Popescu, Testng : Testing, the next generation, 2007.

F. Boussemart, C. Lecoutre, and C. Piette, Xcsp3 : An integrated format for benchmarking combinatorial constrained problems, 2016.

R. Brummayer and M. Järvisalo, Testing and debugging techniques for answer set solver development, Theory and Practice of Logic Programming, vol.10, issue.4-6, pp.741-758, 2010.

R. Brummayer, F. Lonsing, and A. Biere, Automated testing and debugging of sat and qbf solvers, International Conference on Theory and Applications of Satisfiability Testing, pp.44-57, 2010.

M. Carlier, C. Dubois, and A. Gotlieb, A certified constraint solver over finite domains, International Symposium on Formal Methods, pp.116-131, 2012.
DOI : 10.1007/978-3-642-32759-9_12
URL : https://hal.archives-ouvertes.fr/hal-01126135

K. Claessen and J. Hughes, Quickcheck : a lightweight tool for random testing of haskell programs, Acm sigplan notices, vol.46, issue.4, pp.53-64, 2011.

, The coq development team : The coq proof assistant

M. Dahmen, A debugger for constraints in prolog, 1991.

R. Debruyune and J. Fekete, Narendra Jussien et Mohammad Ghoniem : Proposition de format concret pour des traces générées par des solveurs de contraintes réalisation rntl oa, 2001.

C. Dubois and A. Gotlieb, Solveurs cp (fd) vérifiés formellement, Neuvi ? mes Journ ? es Francophones de Programmation par Contraintes (JFPC 2013), pp.115-118, 2013.

M. Ducassé, Opium+, a meta-debugger for prolog, European Conference on Artificail Intelligence, 1988.

J. Filliâtre and C. Marché, The why/krakatoa/caduceus platform for deductive program verification, International Conference on Computer Aided Verification, pp.173-177, 2007.

J. Filliâtre and A. Paskevich, ESOP'13 22nd European Symposium on Programming, vol.7792, 2013.

F. Kirchner, N. Kosmatov, and V. Prevosto, Julien Signoles et Boris Yakobowski : Frama-c : A software analysis perspective, Formal Aspects of Computing, vol.27, issue.3, pp.573-609, 2015.
DOI : 10.1007/s00165-014-0326-7

K. Kuchcinski and R. Szymanek, Jacop-java constraint programming solver, CP Solvers : Modeling, Applications, Integration, and Standardization, co-located with the 19th International Conference on Principles and Practice of Constraint Programming, 2013.

L. Michel, P. Schaus, and P. Van-hentenryck, MiniCP : A lightweight solver for constraint programming, 2018.

C. Lecoutre and S. Tabary, Abscon 112 : towards more robustness, 3rd International Constraint Solver Competition (CSC'08), pp.41-48, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00870841

M. Meier, Debugging constraint programs, International Conference on Principles and Practice of Constraint Programming, pp.204-221, 1995.
DOI : 10.1007/3-540-60299-2_13

N. Nethercote, J. Peter, R. Stuckey, S. Becket, . Brand et al., Minizinc : Towards a standard cp modelling language, International Conference on Principles and Practice of Constraint Programming, pp.529-543, 2007.
DOI : 10.1007/978-3-540-74970-7_38

A. Niemetz, M. Preiner, and A. Biere, Model-based api testing for smt solvers, Proceedings of the 15th International Testé comme jamais

X. Par and . Gillard, Pierre Schaus 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.

D. Allouche, I. André, S. Barbe, J. Davies, S. De-givry et al., Computational protein design as an optimization problem, Artificial Intelligence, vol.212, pp.59-79, 2014.
DOI : 10.1016/j.artint.2014.03.005
URL : https://hal.archives-ouvertes.fr/hal-01268554

D. Allouche, C. Bessiere, S. Boizumault, P. De-givry, J. Gutierrez et al., Tractability-preserving transformations of global cost functions, Artificial Intelligence Journal, vol.238, pp.166-189, 2016.
DOI : 10.1016/j.artint.2016.06.005
URL : https://hal.archives-ouvertes.fr/lirmm-01374533

D. Allouche, S. De-givry, G. Katsirelos, T. Schiex, and M. Zytnicki, Anytime hybrid best-first search with tree decomposition for weighted csp, Proc. of Principles and Practice of Constraint Programming (CP'15), pp.12-29
DOI : 10.1007/978-3-319-23219-5_2
URL : https://hal.archives-ouvertes.fr/hal-01198361

. Springer, , 2015.

F. Bacchus and P. Van-beek, On the conversion between non-binary and binary constraint satisfaction problems, Proceedings of AAAI 1998, pp.310-318, 1998.

D. Batra, P. Yadollahpour, A. Guzmanrivera, and G. Shakhnarovich, Diverse m-best solutions in markov random fields, European Conference on Computer Vision, pp.1-16, 2012.

C. Bessière and P. Van-hentenryck, To be or not to be ... a global constraint, Proceedings of CP'03, pp.789-794, 2003.

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, ECAI, vol.16, p.146, 2004.

C. Chen, V. Kolmogorov, Y. Zhu, D. Metaxas, and C. Lampert, Computing the m most probable modes of a graphical model, Proc. of Artificial Intelligence and Statistics, pp.161-169, 2013.

C. Chen, H. Liu, D. Metaxas, and T. Zhao, Mode estimation for high dimensional discrete tree graphical models, Proceedings of Advances in neural information processing systems, pp.1323-1331, 2014.

C. Chen, C. Yuan, and C. Chen, Solving m-modes using heuristic search, Proc. of IJCAI'16, pp.3584-3590, 2016.

M. Ruffini, J. Vucinic, S. De-givry, G. Katsirelos, S. Barbe et al., Schiex 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.

C. Chen, C. Yuan, Z. Ye, and C. Chen, Solving m-modes in loopy graphs using tree decompositions, Proc. of the International Conference on Probabilistic Graphical Models, pp.145-156, 2018.

M. Cooper, S. De-givry, M. Sanchez, T. Schiex, M. Zytnicki et al., Soft arc consistency revisited. Artificial Intelligence Journal, vol.174, pp.449-478, 2010.

R. Das and D. Baker, Macromolecular modeling with rosetta, Annu. Rev. Biochem, vol.77, pp.363-382, 2008.
DOI : 10.1146/annurev.biochem.77.062906.171838

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

T. Had?i?, A. Holland, and B. O'sullivan, Reasoning about optimal collections of solutions, International Conference on Principles and Practice of Constraint Programming, pp.409-423

. Springer, , 2009.

E. Hebrard, B. Hnich, B. O'sullivan, and T. Walsh, Finding diverse and similar solutions in constraint programming, Proceedings of AAAI 2005, vol.5, pp.372-377, 2005.

E. Hebrard, B. O'sullivan, and T. Walsh, Distance constraints in constraint satisfaction, IJCAI, vol.2007, pp.106-111, 2007.

B. Hurley, B. O'sullivan, D. Allouche, G. Katsirelos, T. Schiex et al., Multi-language evaluation of exact solvers in graphical model discrete optimization, Constraints, pp.1-22, 2016.

A. Kirillov, B. Savchynskyy, D. Schlesinger, D. Vetrov, and C. Rother, Inferring m-best diverse labelings in a single one, Proceedings of the IEEE International Conference on Computer Vision, pp.1814-1822, 2015.

V. Kolmogorov, Convergent tree-reweighted message passing for energy minimization. IEEE transactions on pattern analysis and machine intelligence, vol.28, pp.1568-1583, 2006.
DOI : 10.1109/tpami.2006.200

J. Larrosa and R. Dechter, On the dual representation of non-binary semiring-based CSPs, CP'2000 workshop on soft constraints, 2000.

J. H. Lee and K. L. Leung, Consistency Techniques for Global Cost Functions in Weighted Constraint Satisfaction, Journal of Artificial Intelligence Research, vol.43, pp.257-292, 2012.

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff : Engineering an efficient sat solver, 38 th Design Automation Conference (DAC'01), pp.530-535, 2001.
DOI : 10.1109/dac.2001.935565

H. Noguchi, C. Addy, D. Simoncini, S. Wouters, B. Mylemans et al., Computational design of symmetrical eight-bladed ?-propeller proteins, IUCrJ, vol.6, issue.1, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02154353

G. Pesant, A regular language membership constraint for finite sequences of variables. In International conference on principles and practice of constraint programming, pp.482-495, 2004.

T. Petit and A. C. Trapp, Finding diverse solutions of high quality to constraint optimization problems, Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01170003

A. Prasad, S. Jegelka, and D. Batra, Submodular meets structured : Finding diverse subsets in exponentially-large structured item sets, Advances in Neural Information Processing Systems, pp.2645-2653, 2014.

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

M. Sánchez, S. De-givry, and T. Schiex, Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques, Constraints, vol.13, issue.1, pp.130-154, 2008.

T. Schiex, Arc consistency for soft constraints, Principles and Practice of Constraint Programming -CP 2000, vol.1894, pp.411-424, 2000.

D. Schlesinger, Exact solution of permuted submodular minsum problems, International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, pp.28-38, 2007.

D. Simoncini, D. Allouche, S. De-givry, C. Delmas, S. Barbe et al., Guaranteed discrete energy optimization on large protein design problems, Journal of chemical theory and computation, vol.11, issue.12, pp.5980-5989, 2015.

S. Traoré, D. Allouche, I. André, S. De-givry, G. Katsirelos et al., A new framework for computational protein design through cost function network optimization, Bioinformatics, vol.29, issue.17, pp.2129-2136, 2013.

M. Zytnicki, C. Gaspin, S. De-givry, and T. Schiex, Bounds Arc Consistency for Weighted CSPs, Journal of Artificial Intelligence Research, vol.35, pp.593-621, 2009.

M. Ruffini, J. Vucinic, S. De-givry, G. Katsirelos, S. Barbe et al., Schiex 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.

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

D. Habet and C. Terrioux, Conflict History based Search for Constraint Satisfaction Problem, SAC, pp.1117-1122, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02090618

C. Lecoutre, L. Saï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.3434-3440, 2016.

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

, Une heuristique basée sur l'historique des conflits pour les problèmes de satisfaction de contraintes par Djamal Habet, Cyril Terrioux 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.

J. Andrew and A. B. Baker, Experimental results on the application of satisfiability algorithms to scheduling problems, Proceedings of the Twelfth National Conference on Artificial Intelligence, pp.1092-1097, 1994.

C. Ansótegui and F. Manyà, Mapping problems with finite-domain variables to problems with boolean variables, Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, SAT'04, pp.1-15, 2005.

. Daniel-le-berre, Exploiting the real power of unit propagation lookahead, Electronic Notes in Discrete Mathematics, vol.9, pp.59-80, 2001.

C. Bessière, E. Hebrard, and T. Walsh, Local consistency in SAT, International Conference on Theory and Application of satisfiability testing, pp.400-407, 2003.

D. Brélaz, New methods to color the vertices of a graph, Commun. ACM, vol.22, issue.4, pp.251-256, 1979.

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.

N. Eén and N. Sörensson, An extensible sat-solver, Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), pp.502-518, 2003.

R. Génisson and P. Jégou, Davis and Putnam were already forward checking, ECAI'96 : Proceedings of the 12th European Conference on Artificial Intelligence, pp.180-184, 1996.

I. P. Gent, Arc consistency in SAT. ECAI'02 : Proceedings of the 15th European Conference on Artificial Intelligence, pp.121-125, 2002.

J. H. Marijn, O. Heule, . Kullmann, W. Victor, and . Marek, Solving and verifying the boolean pythagorean triples problem via cube-and-conquer, Theory and Applications of Satisfiability Testing -SAT 2016 -19th International Conference, pp.228-245, 2016.

K. Iwama and S. Miyazaki, Sat-variable complexity of hard combinatorial problems, Proceedings of the world computer congress of the IFIP, pp.253-258, 1994.

S. Kasif, On the Parallel Complexity of Discrete Relaxation in Constraint Satisafaction Networks, Journal of Artificial Intelligence, vol.45, pp.275-286, 1990.

J. D. Kleer, A comparison of ATMS and CSP techniques, Proceedings of IJCAI'89, pp.290-296, 1989.

O. Kullmann, On the use of autarkies for satisfiability decision. Electronic Notes in Discrete Mathematics, vol.9, pp.231-253, 2001.

J. Larrosa, Merging constraint satisfaction subproblems to avoid redundant search, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, pp.424-433, 1997.

, Uwe Schöning : A probabilistic algorithm for k-sat and constraint satisfaction problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS '99, p.410, 1999.

V. Sule, Generalization of boole-shannon expansion, consistency of boolean equations and elimination by orthonormal expansion, 2013.

, Virendra Sule : An algorithm for boolean satisfiability based on generalized orthonormal expansion

. Corr, , 2014.

N. Tamura, A. Taga, S. Kitagawa, and M. Banbara, Compiling finite linear csp into sat, Constraints, vol.14, issue.2, pp.254-272, 2009.
DOI : 10.1007/11889205_42
URL : http://bach.istc.kobe-u.ac.jp/csp2sat/cp2006.pdf

. Robert-endre-tarjan, Depth first search and linear graph algorithms, SIAM J. Comput, vol.1, pp.146-160, 1972.

G. S. Tseitin, On the complexity of derivations in the propositional calculus, éditeur : Structures in Constructives Mathematics and Mathematical Logic, Part II, pp.115-125, 1968.

, Une autre règle de séparation pour des codages de CSP vers SAT par Richard Ostrowski, Lionel Paris, Adrien Varet 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.

H. Dell, C. Komusiewicz, N. Talmon, and M. Weller, The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge : The Second Iteration. In IPEC, vol.30, 2018.

P. Jégou, H. Kanso, and C. Terrioux, On the Relevance of Optimal Tree Decompositions for Constraint Networks, Proceedings of ICTAI, pp.738-743, 2018.

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

N. Robertson and P. D. Seymour, Graph minors II : Algorithmic aspects of treewidth, Algorithms, vol.7, pp.309-322, 1986.

, Sur la pertinence des décompositions arborescentes optimales pour la résolution de CSP par Philippe Jégou, Hélène Kanso, Cyril Terrioux 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite-time analysis of the multiarmed bandit problem. Machine Learning, vol.47, pp.235-256, 2002.

A. Balafrej, C. Bessiere, and A. Paparrizou, Multi-armed bandits for adaptive constraint propaHeuristiques de recherche : un bandit pour les gouverner toutes par Hugues Wattez, Frédéric Koriche, Christophe Lecoutre, Anastasia Paparrizou, Sébastien Tabary 15 es Journées Francophones de Programmation par Contraintes -JFPC, pp.290-296, 2015.

C. Bessiere, B. Zanuttini, and C. Fernandez, Measuring search trees, Proceedings of ECAI'04 workshop on Modelling and Solving Problems with Constraints, pp.31-40, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00108865

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

S. Gay, R. Hartert, C. Lecoutre, and P. Schauss, Conflict ordering search for scheduling problems, Proceedings of CP'15, pp.140-148, 2015.

C. Gomes, B. Selman, N. Crato, and H. Kautz, Heavy-tailed phenomena in satisfiability and constraint satisfaction problems, Journal of Automated Reasoning, vol.24, pp.67-100, 2000.

C. Gomes, B. Selman, and H. A. Kautz, Boosting combinatorial search through randomization, Proceedings of AAAI'98, pp.431-437, 1998.

R. Haralick and G. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, pp.263-313, 1980.

M. Luby, A. Sinclair, and D. Zuckerman, Optimal speedup of las vegas algorithms, Inf. Process. Lett, vol.47, issue.4, pp.173-180, 1993.

L. Michel and P. Van-hentenryck, Activitybased search for black-box constraint programming solvers, Proceedings of CPAIOR'12, pp.228-243, 2012.

, Ugo Montanari : Network of constraints : Fundamental properties and applications to picture processing, Information Science, vol.7, pp.95-132, 1974.

G. Pesant, C. Quimper, and A. Zanarini, Counting-based search : Branching heuristics for constraint satisfaction problems, Journal of Artificial Intelligence Research, vol.43, pp.173-210, 2012.

P. Refalo, Impact-based search strategies for constraint programming, Proceedings of CP'04, pp.557-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41

D. Sabin and E. C. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings of CP'94, pp.10-20, 1994.

B. Smith and S. Grant, Trying harder to fail first, Proceedings of ECAI'98, pp.249-253, 1998.

R. Sutton and A. G. Barto, Reinforcement learning : An introduction, vol.9, p.1054, 1998.

W. Xia and R. H. , Yap : Learning robust search strategies using a bandit-based approach, pp.6657-6665, 2018.

, Heuristiques de recherche : un bandit pour les gouverner toutes par Hugues Wattez, Frédéric Koriche, Christophe Lecoutre, Anastasia Paparrizou, Sébastien Tabary 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.

A. Abramé and D. Habet, On the extension of learning for Max-SAT, vol.241, pp.1-10, 2014.

A. Abramé and D. Habet, AHMAXSAT : Description and evaluation of a branch and bound Max-SAT solver, JSAT, vol.9, pp.89-128, 2015.

A. Abramé and D. Habet, On the resiliency of unit propagation to max-resolution, pp.268-274, 2015.

M. L. Bonet, J. Levy, and F. Manyà, Resolution for max-sat, JAIR, vol.171, pp.606-618, 2007.
DOI : 10.1016/j.artint.2007.03.001
URL : https://doi.org/10.1016/j.artint.2007.03.001

C. M. Li, F. Manyà, N. O. Mohamedou, and J. Planes, Resolution-based lower bounds in maxsat, Constraints, vol.15, pp.456-484, 2010.
DOI : 10.1007/s10601-010-9097-9
URL : https://digital.csic.es/bitstream/10261/161611/1/accesoRestringido.pdf

C. Li, F. Manyà, and J. Planes, Detecting disjoint inconsistent subformulas for computing lower bounds for max-sat, AAAI-06, pp.86-91, 2006.

C. M. Li, F. Manyà, and J. Planes, New inference rules for max-sat, JAIR, vol.30, pp.321-359, 2007.
DOI : 10.1613/jair.2215
URL : http://www.ics.uci.edu/%7Edechter/courses/ics-275a/spring-2007/project/chu-min-li.pdf

J. P. Marques-silva and K. A. Sakallah, Grasp : A search algorithm for propositional satisfiability, IEEE Transactions on Computers, vol.48, pp.506-521, 1999.
DOI : 10.1109/12.769433
URL : https://eprints.soton.ac.uk/262032/1/jpms-tcomp99.pdf

, Sur l'UP-résilience des k-UCSs binaires par Mohamed Sami Cherif, Djamal Habet 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.

N. Beldiceanu, M. Carlsson, T. Petit, and J. Régin, An O(nlog(n)) bound consistency algorithm for the conjunction of an alldifferent and an inequality between a sum of variables and a constant, and its generalization, ECAI, vol.12, pp.145-150, 2012.

F. Boussemart and F. Hemery, Christophe Lecoutre et Lakhdar Sais : Boosting systematic search by weighting constraints, ECAI, vol.16, p.146, 2004.

. Ilog-cplex, High-performance software for mathematical programming and optimization, 2005.

T. Simon-de-givry, G. Schiex, and . Verfaillie, Exploiting tree decomposition and soft local consistency in weighted csp, AAAI, vol.6, pp.1-6, 2006.

P. Carla, B. Gomes, H. Selman, and . Kautz, Boosting combinatorial search through randomization, vol.98, pp.431-437, 1998.

D. William, M. L. Harvey, and . Ginsberg, Limited discrepancy search, Proceedings IJCAI'95, 1995.

P. Jégou, S. N. Ndiaye, and C. Terrioux, Computing and exploiting tree-decompositions for solving constraint networks, Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP-2005), pp.777-781, 2005.

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

Y. Jin, J. Hamiez, and J. Hao, Algorithms for the minimum sum coloring problem : a review, Artificial Intelligence Review, pp.1-28, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01412512

U. Kjaerulff, Triangulation of Graphs -Algorithms Giving Small Total State Space. Rapport technique, Judex R.R. Aalborg, 1990.

, Améliorations de l'hybridation PPC et PLNE pour la somme coloration par Samba Ndojh Ndiaye 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.

L. Kotthoff, LLAMA : leveraging learning to automatically manage algorithms. CoRR, abs/1306.1031, 2013.

L. Kotthoff, Algorithm selection for combinatorial search problems : A survey, AI Magazine, vol.35, issue.3, pp.48-60, 2014.

L. Kotthoff and P. Kerschke, Holger Hoos et Heike Trautmann : Improving the state of the art in inexact TSP solving using per-instance algorithm selection, 2015.

L. Kotthoff, C. Mccreesh, and C. Solnon, Portfolios of subgraph isomorphism algorithms, Learning and Intelligent OptimizatioN Conference, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01301829

M. Kubale, Graph colorings, vol.352, 2004.

E. Kubicka, J. Allen, and . Schwenk, An introduction to chromatic sums, Proceedings of the 17th conference on ACM Annual Computer Science Conference, pp.39-45, 1989.

C. Lecat, C. Li, C. Lucet, and Y. Li, Exact methods for the minimum sum coloring problem, DPCP-2015, pp.61-69, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01326666

C. Lecat, C. Lucet, and C. Li, Sum coloring : New upper bounds for the chromatic strength. CoRR, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01321029

L. Michel and . Van-hentenryck, Activity-based search for black-box constraint programming solvers, Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, pp.228-243

. Springer, , 2012.

M. Maël, C. Samba-ndojh-ndiaye, and . Solnon, Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem, 2017.

E. Eoin-o'mahony, A. Hebrard, C. Holland, . Nugent, O. Barry et al., Using case-based reasoning in an algorithm portfolio for constraint solving, Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, 2008.

R. John, Rice : The algorithm selection problem, Advances in Computers, vol.15, pp.65-118, 1976.

N. Robertson and P. D. Seymour, Graph minors II : Algorithmic aspects of tree-width, Algorithms, vol.7, pp.309-322, 1986.

C. Schulte, Guido Tack et Mikael Z. Lagerkvist : Modeling. In Christian Schulte, Guido Tack et Mikael Z. Lagerkvist, éditeurs : Modeling and Programming

J. Seipp, M. Braun, J. Garimort, and M. Helmert, Learning portfolios of automatically tuned planners, ICAPS, 2012.

Y. Wang, J. Hao, F. Glover, and Z. Lü, Solving the minimum sum coloring problem via binary quadratic programming. Optimization, 2012.

L. Xu, F. Hutter, and H. Holger, Hoos et Kevin Leyton-Brown : SATzilla : Portfolio-based algorithm selection for SAT, J. Artif. Intell. Res. (JAIR), vol.32, pp.565-606, 2008.

, Améliorations de l'hybridation PPC et PLNE pour la somme coloration par Samba Ndojh Ndiaye 15 es Journées Francophones de Programmation par Contraintes -JFPC, 2019.