1. K. Abhishek, S. Leyffer, and J. Linderoth, FilMINT: An outer-approximation-based solver for nonlinear mixed integer programs, Tech. Rep. Preprint ANL/MCS-P1374-0906, Argonne National Laboratory, Mathematics and Science Division, September 2006.
2. P. Armand, A quasi-newton penalty barrier method for convex minimization problems, Computational Optimization and Applications, 26 (2003), pp. 5–34.
3. A. Atamt¨urk and V. Narayanan, Conic mixed-integer rounding cuts, Research Report BCOL.06.03, IEOR, University of California-Berkeley, December 2006.
4. H. Benson, MILANO - a Matlab-based code for mixed-integer linear and nonlinear optimization. http://www.pages.drexel.edu/~hvb22/milano .
5. , Mixed-integer nonlinear programming using interior-point methods, tech.rep., Submitted to Optimization Methods and Software, November 2007.