L. G. Casado, J. A. 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

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.

M. C. Markot, J. Fernandez, L. G. 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

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

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