\begin{thebibliography}{1}

\bibitem{andersen}
D.E. Andersen and K.D. Andersen.
\newblock Presolving in linear programming.
\newblock {\em Mathematical Programming}, 71:221--245, 1995.

\bibitem{couenne}
P.~Belotti, J.~Lee, L.~Liberti, F.~Margot, and A.~W\"achter.
\newblock Branching and bounds tightening techniques for non-convex {MINLP}.
\newblock {\em Optimization Methods and Software}, 24(4):597--634, 2009.

\bibitem{obbt}
A.~Caprara and M.~Locatelli.
\newblock Global optimization problems and domain reduction strategies.
\newblock {\em Mathematical Programming}, to appear.

\bibitem{cplex11}
ILOG.
\newblock {\em ILOG CPLEX 11.0 User's Manual}.
\newblock ILOG S.A., Gentilly, France, 2008.

\bibitem{moore2}
R.E. Moore, R.B. Kearfott, and M.J. Cloud.
\newblock {\em Introduction to Interval Analysis}.
\newblock SIAM, Philadelphia, 2009.

\bibitem{roman}
S.~Roman.
\newblock {\em Lattices and Ordered Sets}.
\newblock Springer, New York, 2008.

\bibitem{tarski}
A.~Tarski.
\newblock A lattice-theoretical fixpoint theorem and its applications.
\newblock {\em Pacific Journal of Mathematics}, 5(2):285--309, 1955.

\end{thebibliography}
