1.

B. Borchers and J.E. Mitchell, “An improved branch and bound algorithm for mixed integer nonlinear programming, ” Computers and Operations Research, vol. 21, no. 4, pp. 359–367, 1994.

2.

B. Borchers and J.E. Mitchell, “A computational comparison of branch and bound and outer approximation methods for 0–1 mixed integer nonlinear programs, ” Computers and Operations Research, vol. 24, no. 8, pp. 699–701, 1997.

3.

A.R. Conn, N.I.M. Gould, and Ph.L. Toint, LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer Verlag: Heidelberg, 1992.

4.

A.R. Conn, N.I.M. Gould, and Ph.L. Toint, “Methods for nonlinear constraints in optimization calculations, ” Report RAL-TR-96-042, Rutherford Appleton Laboratory, 1996. (To appear in The State of the Art in Numerical Analysis, I. Duff and G.A. Watson (Eds.)).

5.

R.J. Dakin, “A tree search algorithm for mixed integer programming problems, ” Computer Journal, vol. 8, pp. 250–255, 1965.

6.

J.E. Dennis, M. El-Alem, and K.A. Williamson, “A trust-region approach to nonlinear systems of equalities and inequalities, ” SIAM Journal on Optimization, vol. 9, pp. 291–315, 1999.

7.

M. Duran and I.E. Grossmann, “An outer-approximation algorithm for a class of mixed-integer nonlinear programs, ” Mathematical Programming, vol. 36, pp. 307–339, 1986.

8.

M. El-Hallabi and R.A. Tapia, “An inexact trust-region feasible-point algorithm for non-linear systems of equalities and inequalities, ” Technical Report TR-09, Department of Computational and Applied Mathematics, Rice University, Houston, Texas, USA, 1995.

9.

R. Fletcher, Practical Methods of Optimization, 2nd ed., John Wiley: Chichester, 1987.

10.

R. Fletcher and S. Leyffer, “Solving mixed integer nonlinear programs by outer approximation, ” Mathematical Programming, vol. 66, pp. 327–349, 1994.

11.

R. Fletcher and S. Leyffer, “Nonlinear programming without a penalty function, ” Numerical Analysis Report NA/171, Department of Mathematics, University of Dundee, Sept. 1997.

12.

R. Fletcher and S. Leyffer, “User manual for filter SQP, ” Numerical Analysis Report NA/181, Dundee University, April 1998.

13.

O.E. Flippo and A.H.G. Rinnoy Kan, “Decomposition in general mathematical programming, ” Mathematical Programming, vol. 60, pp. 361–382, 1993.

14.

C.A. Floudas, Nonlinear and Mixed-Integer Optimization, Oxford University Press: New York, 1995.

15.

A.M. Geoffrion, “Generalized benders decomposition, ” Journal of Optimization Theory and Applications, vol. 10, pp. 237–260, 1972.

16.

I.E. Grossmann and Z. Kravanja, “Mixed-integer nonlinear programming: A survey of algorithms and applications, ” in Large-Scale Optimization with Applications, Part II: Optimal Design and Control, A.R. Conn, L.T. Biegler, T.F. Coleman, and F.N. Santosa (Eds.), Springer: New York, Berlin, 1997.

17.

I.E. Grossmann and R.W.H. Sargent, “Optimal design of multipurpose batch plants, ” Ind. Engng. Chem. Process Des. Dev., vol. 18, pp. 343–348, 1979.

18.

O.K. Gupta and A. Ravindran, “Branch and bound experiments in convex nonlinear integer programming, ” Management Science, vol. 31, pp. 1533–1546, 1985.

19.

S.P. Han, “A globally convergent method for nonlinear programming, ” Journal of Optimization Theory and Applications, vol. 22, no. 3, pp. 297–309, 1977.

20.

R. Horst and H. Tuy, Global Optimization: Deterministic Approaches, 2nd ed., Springer-Verlag: Berlin, 1993.

21.

G.R. Kocis and I.E. Grossmann, “Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis, ” Industrial Engineering Chemistry Research, vol. 27, pp. 1407–1421, 1988.

22.

A.H. Land and A.G. Doig, “An automatic method for solving discrete programming problems, ” Econometrica, vol. 28, pp. 497–520, 1960.

23.

M.J.D. Powell, “A fast algorithm for nonlinearly constrained optimization calculations, ” in Numerical Analysis, 1977, G.A. Watson (Ed.), Springer Verlag: Berlin 1978, pp. 144–157.

24.

I. Quesada and I.E. Grossmann, “An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems, ” Computers and Chemical Engineering, vol. 16, pp. 937–947, 1992.

25.

A.J. Quist, R. van Geemert, J.E. Hoogenboom, T. Illés, E. de Klerk, C. Roos, and T. Terlaky, “Optimization of a nuclear reactor core reload pattern using nonlinear optimization and search heuristics, ” Draft paper, Delft University of Technology, Faculty of Applied Mathematics, Department of Operation Research, Mekelweg 4, 2628 CD Delft, The Netherlands, Sept. 1997.

26.

R.A. Stubbs and S. Mehrotra, “A branch-and-cut method for 0–1 mixed convex programming, ” Technical report 96-01, Department of IE/MS, Northwestern University, Evanston, IL 60208, USA, Jan. 1996.

27.

J. Viswanathan and I.E. Grossmann, “Optimal feed location and number of trays for distillation columns with multiple feeds, ” I&EC Research, vol. 32, pp. 2942–2949, 1993.

28.

O.V. Volkovich, V.A. Roshchin, and I.V. Sergienko, “Models and methods of solution of quadratic integer programming problems, ” Cybernetics, vol. 23, pp. 289–305, 1987.

29.

T. Westerlund, J. Isaksson, and I. Harjunkoski, “Solving a production optimization problem in the paper industry, ” Report 95-146-A, Department of Chemical Engineering, Abo Akademi, Abo, Finland, 1995.

30.

R.B. Wilson, “A simplicial algorithm for concave programming, Ph.D. Thesis, Harvard University Graduate School of Business Administration, 1963.

31.

Y. Yuan, “Trust region algorithms for nonlinear equations, ” Technical Report 049, Department of Mathematics, Hong Kong University, Hong Kong, 1994.