\begin{PageSummary}
\end{PageSummary}
\begin{thebibliography}{10}

\bibitem{abhishek.leyffer.linderoth:06}
 K.~Abhishek, S.~Leyffer, and J.~T. Linderoth. {FilMINT}: {An}
  outer-approximation-based solver for nonlinear mixed integer programs.
  Preprint ANL/MCS-P1374-0906, Mathematics and Computer Science Division,
  Argonne National Laboratory, 2006.

\bibitem{Betal}
P.~Bonami, A.~W\auml chter, L.T.~Biegler, A.R.~Conn, G.~Cornu\eacute jols,
I.E.~Grossmann, C.D.~Laird, J.~Lee, A.~Lodi, F.~Margot and
N.~Sawaya.
\newblock An algorithmic framework for convex mixed integer nonlinear programs. {\em Discrete Optimization} 5:186--204, 2008.

\bibitem{bonami.etal:06}
{P.~Bonami, G.~Cornu\eacute jols, A.~Lodi, and F.~Margot}. {A feasibility
  pump for mixed integer nonlinear programs}. {\em Mathematical Programming}, 119
  (2009), pp.~331--352.

\bibitem{bonami.goncalves:08}
{P.~Bonami and J.~Gon{\c{c}}alves}. {Primal heuristics for mixed
  integer nonlinear programs}. Research Report, IBM T. J. Watson Research
  Center, Yorktown, USA, September 2008.

\bibitem{hot:2009}
P. Bonami, M.~{K{\i}l{\i}n\c{c}} and J.~Linderoth.
Algorithms and Software for Convex Mixed Integer Nonlinear Programs.
Technical Report \#1664, Computer Sciences Department, University of
Wisconsin-Madison, 2009.

\bibitem{DG}
M.~Duran and I.E.~Grossmann.
\newblock An outer-approximation algorithm for a class of mixed-integer nonlinear programs.
\newblock {\em Mathematical Programming}, 36:307--339, 1986.

\bibitem{Gupta80Nonlinear}
O.K.~Gupta and V.~Ravindran.
\newblock Branch and bound experiments in convex nonlinear integer programming.
\newblock {\em Management Science}, 31:1533--1546, 1985.

\bibitem{FL}
R.~Fletcher and S.~Leyffer.
\newblock Solving mixed integer nonlinear programs by outer approximation.
\newblock {\em Mathematical Programming}, 66:327--349, 1994.

\bibitem{FiLter}
R.~Fletcher and S.~Leyffer.
\newblock User manual for filter{SQP}.
\newblock {\em University of Dundee Numerical Analysis Report NA-181}, 1998.

\bibitem{Gay}
D.M.~Gay.
\newblock Writing \texttt{\bf .nl} files.
\newblock Sandia National Laboratories, Technical Report No. 2005-7907P, 2005.

\bibitem{QG}
I.~Quesada and I.E.~Grossmann.
\newblock An {LP/NLP} based branched and bound algorithm for convex {MINLP} optimization problems.
\newblock {\em Computers and Chemical Engineering}, 16:937--947, 1992.

\bibitem{AMPL}
R.~Fourer and D.M.~Gay and B.W.~Kernighan.
\newblock AMPL: A Modeling Language for Mathematical
Programming, Second Edition,
\newblock Duxbury Press Brooks Cole Publishing Co., 2003.


\bibitem{NocedalAdaptive}
J.~Nocedal, A.~W\"achter, and R.~A. Waltz.
\newblock Adaptive Barrier Strategies for Nonlinear Interior Methods.
\newblock Research Report RC 23563, IBM T. J. Watson Research Center, Yorktown, USA (March 2005; revised January 2006)

\bibitem{AndreasIpopt}
A.~W\"achter and L.~T.~Biegler.
\newblock On the Implementation of a Primal-Dual Interior Point Filter Line Search Algorithm for Large-Scale Nonlinear Programming.
\newblock Mathematical Programming 106(1), pp. 25-57, 2006
\end{thebibliography}
