G. Alefeld and J. Herzberger, Introduction to Interval Computations, 1983.

A. Anglada, P. Codognet, and L. Zimmer, An adaptive search for the NSCSPs, 2004.

R. Battiti and G. Tecchiolli, The continuous reactive tabu search : blending combinatorial optimization and stochastic search for global optimization Interval constraint logic programming, Constraint programming : basics and trends, pp.1-21, 1995.

F. Benhamou, F. Goualard, E. Languénou, and M. Christie, Interval constraint solving for camera control and motion planning, ACM Transactions on Computational Logic, vol.5, issue.4, 2004.
DOI : 10.1145/1024922.1024927

URL : http://arxiv.org/abs/cs/0007002

F. Benhamou, D. Mcallester, and P. Van-hentenryck, CLP(Intervals) revisited, Procs. of the International Symposium on Logic Programming (ILPS'94), pp.124-138, 1994.

C. Blum and A. Roli, Metaheuristics in combinatorial optimization, ACM Computing Surveys, vol.35, issue.3, pp.268-308, 2003.
DOI : 10.1145/937503.937505

URL : https://hal.archives-ouvertes.fr/hal-01224683

R. Chelouah and P. Siarry, Tabu Search applied to global optimization, European Journal of Operational Research, vol.123, issue.2, 2000.
DOI : 10.1016/S0377-2217(99)00255-6

F. Héì-ene-collavizza, M. Delobel, and . Rueher, Extending consistent domains of numeric CSP, Procs. of the 16th IJCAI, pp.406-411, 1999.

J. Hao, P. Galinier, and M. Habib, Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes, Journal of Heuristics, 1998.

D. Haroud and B. Faltings, Global consistency for continuous constraints, Lecture Notes in Computer Science, vol.874, pp.40-50, 1994.
DOI : 10.1007/3-540-58601-6_88

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Jaulin and E. Walter, Guaranteed tuning, with application to robust control and motion planning, Automatica, vol.32, issue.8, pp.1217-1221, 1996.
DOI : 10.1016/0005-1098(96)00050-7

L. Jaulin and . Walter, Set inversion via interval analysis for nonlinear bounded-error estimation, Automatica, vol.29, issue.4, pp.1053-1064, 1993.
DOI : 10.1016/0005-1098(93)90106-4

A. K. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

Z. Michalewicz, Genetic Algorithms, Numerical Optimization and Constraints, Proceedings of the 6th International Conference on Genetic Algorithms, pp.151-158, 1995.

S. Minton, M. Johnston, A. Philips, and P. Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence, vol.58, issue.1-3, pp.161-205, 1992.
DOI : 10.1016/0004-3702(92)90007-K

N. Mladenovi´cmladenovi´c and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2

R. E. Moore, Interval Analysis, N.J, 1966.

A. Neumaier, Interval methods for systems of equations, volume 37 of Encyclopedia of Mathematics and its Applications, 1990.

P. Hansen, The steepest ascent mildest descent heuristic for combinatorial programming, Congress on Numerical Methods in Combinatorial Optimization, 1986.

J. Sam-haroud and B. V. Faltings, Consistency techniques for continuous constraints, Constraints, vol.1, issue.1-2, pp.85-118, 1996.
DOI : 10.1007/BF00143879

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

V. Barichard and J. Hao, A Population and Interval Constraint Propagation Algorithm, LNCS, vol.2632, pp.88-101, 2003.
DOI : 10.1007/3-540-36970-8_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

P. Van-hentenryck, L. Michel, and Y. Deville, Numerica : A Modeling Language for Global Optimization, 1997.