H. Batnini, C. Michel, and M. Rueher, Mind the gaps: A new splitting strategy for consistency techniques, Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP'05), vol.3709, pp.77-91, 2005.

F. Benhamou, Heterogeneous constraint solvings, Proceedings of the 5th International Conference on Algebraic and Logic Programming, pp.62-76, 1996.

F. Benhamou, F. Goualard, L. Granvilliers, and J. Puget, Revisiting hull and box consistency, Proceedings of the 16th International Conference on Logic Programming, pp.230-244, 1999.

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, Proceedings of the 16th Eureopean Conference on Artificial Intelligence, (ECAI'2004), pp.146-150, 2004.

M. R. Bussieck, A. S. Drud, and A. Meeraus, MinlplibA collection of test models for mixed-integer nonlinear programming, INFORMS Journal on Computing, vol.15, issue.1, pp.114-119, 2003.

G. Chabert and L. Jaulin, Contractor programming, Artificial Intelligence, vol.173, pp.1079-1100, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00428957

F. Héì-ene-collavizza, M. Delobel, and . Rueher, Extending consistent domains of numeric CSP, Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp.406-413, 1999.

E. Hansen, Global optimization using interval analysis. Marcel Dekker, 1992.

M. Robert, G. L. Haralick, and . Elliott, Increasing tree search efficiency for constraint satisfaction problems, Proceedings of the 6th International Joint Conference on Artificial intelligence (IJCAI'79), pp.356-364, 1979.

L. Jaulin and E. 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

R. E. and M. , Interval Analysis, 1966.

M. Pelleau, A. Miné, C. Truchet, and F. Benhamou, A constraint solver based on abstract domains, Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2013), 2013.
DOI : 10.1007/978-3-642-35873-9_26
URL : https://hal.archives-ouvertes.fr/hal-00785604

D. Ratz, Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method, Computing, vol.53, pp.337-354, 1994.

F. Rossi, T. Peter-van-beek, and . Walsh, Handbook of Constraint Programming, 2006.

C. Schulte and P. J. Stuckey, Efficient constraint propagation engines, Transactions on Programming Languages and Systems, vol.31, issue.1, 2008.
DOI : 10.1145/1452044.1452046
URL : http://arxiv.org/pdf/cs/0611009

O. Shcherbina, A. Neumaier, D. Sam-haroud, X. Vu, and T. Nguyen, Benchmarking global optimization and constraint satisfaction codes. In Global Optimization and Constraint Satisfaction, First International Workshop Global Constraint Optimization and Constraint Satisfaction, COCOS, pp.211-222, 2002.
DOI : 10.1007/978-3-540-39901-8_16