I. Araya, G. Trombettoni, and B. Neveu, A Contractor Based on Convex Interval Taylor, Proc. CPAIOR, pp.1-16, 2012.
DOI : 10.1007/978-3-642-29828-8_1

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

I. Araya, G. Trombettoni, B. Neveu, and G. Chabert, Upper bounding in inner regions for global optimization under inequality constraints, Journal of Global Optimization, vol.103, issue.2, pp.145-164, 2014.
DOI : 10.1007/s10898-014-0145-7

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

R. Bixby and E. Rothberg, Progress in computational mixed integer programming???A look back from the other side of the tipping point, Annals of Operations Research, vol.77, issue.3, pp.37-41, 2007.
DOI : 10.1007/s10479-006-0091-y

P. Bonami, M. Kilink, and J. Linderoth, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, 2009.
DOI : 10.1007/978-1-4614-1927-3_1

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

L. Casado, J. Martinez, and I. Garcia, Experiments with a New Selection Criterion in a Fast Interval Optimization Algorithm, Journal of Global Optimization, vol.19, issue.3, pp.247-264, 2001.
DOI : 10.1023/A:1011220023072

G. Chabert, Interval-Based EXplorer, 2015.

G. Chabert and L. Jaulin, Contractor programming, Artificial Intelligence, vol.173, issue.11, pp.1079-1100, 2009.
DOI : 10.1016/j.artint.2009.03.002

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

T. Csendes, New Subinterval Selection Criteria for Interval Global Optimization, Journal of Global Optimization, vol.19, issue.3, pp.307-327, 2001.
DOI : 10.1023/A:1011228208051

T. Csendes and D. Ratz, Subdivision Direction Selection in Interval Methods for Global Optimization, SIAM Journal on Numerical Analysis, vol.34, issue.3, 1997.
DOI : 10.1137/S0036142995281528

A. Felner, S. Kraus, and R. E. Korf, KBFS: K-Best-First Search, Annals of Mathematics and Artificial Intelligence, vol.39, 2003.

R. Kearfott, I. Novoa, and M. , Algorithm 681: INTBIS, a portable interval Newton/bisection package, ACM Transactions on Mathematical Software, vol.16, issue.2, pp.152-157, 1990.
DOI : 10.1145/78928.78931

L. Kocsis and C. Szepesvari, Bandit Based Monte-Carlo Planning, Proc. ECML, pp.282-293, 2006.
DOI : 10.1007/11871842_29

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

M. Markot, J. Fernandez, L. Casado, and T. Csendes, New interval methods for constrained global optimization, Mathematical Programming, vol.18, issue.2, pp.287-318, 2006.
DOI : 10.1007/s10107-005-0607-2

F. Messine, Méthodes d'optimisation globale basées sur l'analyse d'intervalle pour la résolution desprobì emes avec contraintes, 1997.

F. Messine and J. L. Laganouelle, Enclosure Methods for Multivariate Differentiable Functions and Application to Global Optimization, Journal of Universal Computer Science, vol.4, issue.6, pp.589-603, 1998.

R. Misener and C. Floudas, ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations, Journal of Global Optimization, vol.56, issue.2, pp.503-526, 2014.
DOI : 10.1007/s10898-014-0166-2

R. E. Moore, Interval Analysis, 1966.

B. Neveu, G. Trombettoni, and I. Araya, Adaptive constructive interval disjunction: algorithms and experiments, Constraints, vol.2, issue.2, 2015.
DOI : 10.1007/s10601-015-9180-3

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

J. Ninin and F. Messine, A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms, Journal of Global Optimization, vol.11, issue.3, pp.629-644, 2011.
DOI : 10.1007/s10898-010-9531-y

J. Ninin, F. Messine, and P. Hansen, A Reliable Affine Relaxation Method for Global Optimization Accepted to publication, 4OR-Quaterly Journal of Operations Research, 2014.

A. Sabharwal, H. Samulowitz, and C. Reddy, Guiding Combinatorial Optimization with UCT, Proc. CPAIOR, pp.356-361, 2012.
DOI : 10.1007/978-3-642-29828-8_23

O. Shcherbina, A. Neumaier, D. Sam-haroud, X. H. Vu, and T. V. Nguyen, Benchmarking Global Optimization and Constraint Satisfaction Codes, COCOS, Workshop on Global Constraint Optimization and Constraint Satisfaction, 2002.
DOI : 10.1007/978-3-540-39901-8_16

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

M. Tawarmalani and N. V. Sahinidis, Global optimization of mixed-integer nonlinear programs: A theoretical and computational study, Mathematical Programming, vol.99, issue.3, pp.563-591, 2004.
DOI : 10.1007/s10107-003-0467-6

M. Tawarmalani and N. V. Sahinidis, A polyhedral branch-and-cut approach to global optimization, Mathematical Programming, vol.14, issue.2, pp.225-249, 2005.
DOI : 10.1007/s10107-005-0581-8

G. Trombettoni, I. Araya, B. Neveu, and G. Chabert, Inner Regions and Interval Linearizations for Global Optimization, Proc. AAAI, pp.99-104, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00648085

G. Trombettoni and G. Chabert, Constructive Interval Disjunction, Proc. CP, pp.635-650, 2007.
DOI : 10.1007/978-3-540-74970-7_45

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

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