E. Kendall and . Atkins, An introduction to numerical analysis, 1989.

H. Cambazard and N. Jussien, Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming, Constraints, vol.400, issue.1, pp.295-313, 2006.
DOI : 10.1007/s10601-006-9002-8
URL : https://hal.archives-ouvertes.fr/hal-00869105

A. Chabrier, E. Danna, C. L. Pape, and L. Perron, Solving a Network Design Problem, Annals of Operations Research, vol.130, issue.1-4, pp.217-239, 2004.
DOI : 10.1023/B:ANOR.0000032577.81139.84

J. Pedro, C. Copado-méndez, G. Blum, L. Guillén-gosálbez, and . Jiménez, Application of large neighborhood search to strategic supply chain management in the chemical industry, Hybrid Metaheuristics, pp.335-352, 2013.

E. Danna and L. Perron, Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs, Principles and Practice of Constraint Programming CP 2003, pp.817-821, 2003.
DOI : 10.1007/978-3-540-45193-8_59

R. Debruyne, G. Ferrand, N. Jussien, W. Lesaint, S. Ouis et al., Correctness of constraint retraction algorithms, FLAIRS'03: Sixteenth international Florida Artificial Intelligence Research Society conference, pp.172-176, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00085555

E. Demir, T. Bekta¸sbekta¸s, and G. Laporte, An adaptive large neighborhood search heuristic for the Pollution-Routing Problem, European Journal of Operational Research, vol.223, issue.2, 2012.
DOI : 10.1016/j.ejor.2012.06.044

I. P. Gent, I. Miguel, and N. A. Moore, Lazy Explanations for Constraint Propagators, Practical Aspects of Declarative Languages, pp.217-233, 2010.
DOI : 10.1007/978-3-642-11503-5_19

M. Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research, vol.1, pp.25-46, 1993.

D. Godard, P. Laborie, and W. Nuijten, Randomized large neighborhood search for cumulative scheduling, ICAPS, pp.81-89, 2005.

W. Harvey and J. Schimpf, Bounds consistency techniques for long linear constraints, 2002.

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

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

N. Jussien, R. Debruyne, and P. Boizumault, Maintaining arcconsistency within dynamic backtracking, Principles and Practice of Constraint Programming number 1894 in Lecture Notes in Computer Science, pp.249-261, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00869126

N. Jussien and O. Lhomme, Dynamic domain splitting for numeric csps, European Conference on Artificial Intelligence (ECAI'98), pp.224-228, 1998.

A. Attila, . Kovacs, N. Sophie, . Parragh, F. Karl et al., Adaptive large neighborhood search for service technician routing and scheduling problems, Journal of scheduling, vol.15, issue.5, pp.579-600, 2012.

P. Laborie and D. Godard, Self-adapting large neighborhood search:application to singlemode scheduling problems, proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications, pp.28-31, 2007.

J. Mairy, Y. Deville, and P. Van-hentenryck, Reinforced adaptive large neighborhood search, 8th Workshop on Local Search techniques in Constraint Satisfaction (LSCS2011), 2011.

J. Mairy, P. Schaus, and Y. Deville, Generic adaptive heuristics for large neighborhood search, 7th Workshop on Local Search Techniques in Constraint Satisfaction, 2010.

Y. Malitsky, D. Mehta, O. Barry, H. Sullivan, and . Simonis, Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.176-192, 2013.
DOI : 10.1007/978-3-642-38171-3_12

O. Ohrimenko, P. J. Stuckey, and M. Codish, Propagation via lazy clause generation, Constraints, vol.37, issue.1???3, pp.357-391, 2009.
DOI : 10.1007/s10601-008-9064-x

L. Perron, Fast restart policies and large neighborhood search, Principles and Practice of Constraint Programming at CP 2003, 2003.

L. Perron and P. Shaw, Combining Forces to Solve the Car Sequencing Problem, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.225-239, 2004.
DOI : 10.1007/978-3-540-24664-0_16

L. Perron, P. Shaw, and V. Furnon, Propagation Guided Large Neighborhood Search, CP'04, pp.468-481, 2004.
DOI : 10.1007/978-3-540-30201-8_35

D. Pisinger and S. Ropke, Large Neighborhood Search, Handbook of metaheuristics, pp.399-419, 2010.
DOI : 10.1007/978-1-4419-1665-5_13

C. Pralet and G. Verfaillie, Travelling in the World of Local Searches in the Space of Partial Assignments, Lecture Notes in Computer Science, vol.3011, pp.240-255, 2004.
DOI : 10.1007/978-3-540-24664-0_17

P. Prosser, MAC-CBJ: maintaining arc consistency with conflict-directed backjumping, 1995.

C. Prud-'homme and J. Fages, Introduction to choco3, 1st Workshop on CPSolvers: Modeling, Applications, Integration, and Standardization, CP 2013, 2013.

A. Roli, S. Benedettini, T. Stützle, and C. Blum, Large neighbourhood search algorithms for the founder sequence reconstruction problem, Computers & Operations Research, vol.39, issue.2, pp.213-224, 2012.
DOI : 10.1016/j.cor.2011.03.012

T. Schiex and G. Verfaillie, Nogood recording for static and dynamic constraint satisfaction problem, IJAIT, vol.3, issue.2, pp.187-207, 1994.

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Principles and Practice of Constraint Programming, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30

J. Peter and . Stuckey, Lazy clause generation: Combining the power of sat and cp (and mip?) solving, CPAIOR, pp.5-9, 2010.