Bibliography

  1. Adjiman, C. S.; Androulakis, I. P.; Floudas, C. A. (2000) Global optimization of mixed-integer nonlinear problems. AIChE Journal 16, 1769.
  2. Al-Khayyal F.A. & Falk J. E. (1983) Jointly Constrained Biconvex Programming. Math. of Operation Research, 8,2, 273-286
  3. Balas, E. (1979) Disjunctive Programming . Annals of Discrete Mathematics 5 (1979) 3-51
  4. Balas, E. (1985) Disjunctive Programming and a hierarchy of relaxations for discrete optimization problems. SIAM Journal on Algebraic and Discrete Methods, 6, 466-486.
  5. Bao, X., N. V. Sahinidis, and M. Tawarmalani, Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs, Optimization Methods and Software, 24, 485-504, 2009.
  6. Belotti, Pietro., Jon Lee, Leo Liberti, Francois Margot, Andreas Waechter. Branching and bounds tightening techniques for non-convex MINLP, IBM Research Report RC24620, 08/2008.
  7. Benders J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238-252
  8. Bergamini, M. L.; Aguirre, P.; Grossmann, I. E. (2005) Logic-based Outer Approximation for Globally Optimal Synthesis of Process Networks, Computers and Chemical Engineering, 29, 1914-1933.
  9. Bergamini, M.L., I.E. Grossmann, N. Scenna and P. Aguirre (2008) An Improved Piecewise Outer-Approximation Algorithm for the Global Optimization of MINLP Models Involving Concave and Bilinear Terms, Computers and Chemical Engineering 32, 477-493.
  10. Bonami, P., L.T. Biegler, A.R. Conn, G. Cornuejols, I.E. Grossmann, C.D. Laird, J. Lee, A. Lodi, F. Margot, N. Sawaya, A. Waechter (2008) An algorithmic framework for convex mixed integer nonlinear programs, Discrete Optimization  5, 186-204.
  11. Bonami, P., John Forrest, Jon Lee and Andreas Waechter. Rapid development of an MINLP solver with COIN-OR, Optima, 75:1-5, December 2007.
  12. Bragalli, C., Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. An MINLP model and solution method for a water-network optimization problem. Algorithms - ESA 2006 (14th Annual European Symposium. Zurich, Switzerland, September 2006, Proceedings), Y. Azar and T. Erlebach, Eds., pages 696-707. Springer, 2006.
  13. Bragalli, C., Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. Water Network Design by MINLP, IBM Research Report RC24495, 02/2008.
  14. Chachuat, B.; Singer, A. B.; Barton, P. I. (2005) Global Mixed-Integer Dynamic Optimization, AICHE Journal, 51, 2235-2253
  15. Falk, J. E.; Hoffman, K. R. (1976) A Successive Underestimation Method for Concave Minimization Problems. Mathematics of Operations Research 1, (3), 251.
  16. Fletcher, R.; Leyffer, S. (1994) Solving Mixed Integer Nonlinear Programs by Outer Approximation, Mathematical Programming, 66, 327-349
  17. Duran, M. A.; Grossmann, I. E. (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming 36, (3), 307.
  18. Floudas, C. A. (2000) Deterministic Global Optimization: Theory, Methods and Applications. Kluwer Academic Publishers : Dordrecht, The Netherlands
  19. Geoffrion, A. M. (1972) Generalized Benders Decomposition. Journal of Optimization Theory and Applications 10, (4), 237.
  20. Grossmann, I. E. (2002) Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques. Optimization and Engineering 3, 227.
  21. Gunluk, O., Jon Lee and Robert Weismantel. MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL, IBM Research Report RC24213, 03/2007.
  22. Karuppiah, R. and I.E. Grossmann (2008) A Lagrangean based Branch-and-Cut algorithm for global optimization of nonconvex Mixed-Integer Nonlinear Programs with decomposable structures, Journal of Global Optimization 41, 163.
  23. Kesavan, P.; Allgor, R. J.; Gatzke, E. P.; Barton, P. I. (2004), Outer Approximation Algorithms for Separable Nonconvex Mixed-Integer Nonlinear Programs. Mathematical Programming 100, (3), 517.
  24. Lee, J. (2007) "In situ column generation for a cutting-stock problem," Computers & Operations Research 34, (8), 2345-2358.
  25. Lee, J., Shmuel Onn, Robert Weismantel. On test sets for nonlinear integer maximization. Operations Research Letters 36:439-443, 2008.
  26. Lee, S. and I.E. Grossmann, "New Algorithms for Nonlinear Generalized Disjunctive Programming,” Computers and Chemical Engineering, 24, pp.2125- 2141 (2000).
  27. Lee, S. and I.E. Grossmann (2001) "A Global Optimization Algorithm for Nonconvex Generalized Disjunctive Programming and Applications to Process Systems, " Computers and Chemical Engineering 25, 1675-1697.
  28. Lee, S. and I.E. Grossmann (2003) "Global Optimization of Nonlinear Generalized Disjunctive Programming with Bilinear Equality Constraints: Applications to Process Networks," Computers and Chemical Engineering 27,1557-1575.
  29. Lee, J. Mixed Integer Nonlinear Programming: Some Modeling and Solution Issues, in"Business Optimization", IBM Journal of Research and Development, 51(3/4): 489-497, 2007.
  30. Leyffer, S. (2001)Integrating SQP and branch and bound for mixed integer nonlinear programming. Computational Optimization and Applications 18, 295.
  31. Liu, M. L., N. V. Sahinidis, and J. P. Shectman, Planning of chemical process networks via global concave minimization, Chapter 7, pp. 195-230, in I. E. Grossmann (ed.), Global Optimization in Engineering Design, Kluwer Academic Publishers, Dordrecht, MA, 1996.
  32. McCormick, G. P. (1976) Computability of global solutions to factorable nonconvex programs. Part I. Convex underestimating problems. Mathematical Programming, 10, 146-175.
  33. Quesada, I.; Grossmann, I. E. (1992) An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Computers & Chemical Engineering 16, 937.
  34. Quesada, I.; Grossmann, I. E. (1995) A Global Optimization Algorithm for Linear Fractional and Bilinear Programs. Journal of Global Optimization 6, 39.
  35. Raman, R. and I.E. Grossmann, "Modeling and Computational Techniques for Logic Based Integer Programming," Computers and Chemical Engineering, 18, 563 (1994).
  36. Ryoo, H. S. and N. V. Sahinidis, Global optimization of multiplicative programs, Journal of Global Optimization, 26(4), 387-418, 2003.
  37. Ryoo, H. S. and N. V. Sahinidis, Analysis of bounds for multilinear functions, Journal of Global Optimization, 19(4), 403-424, 2001.
  38. Ryoo, H. S. and Sahinidis, N. V. (1996) A branch-and-reduce approach to global optimization. Journal of Global Optimization 8, (2), 107.
  39. Ryoo, H. S. and N. V. Sahinidis, Global optimization of nonconvex NLPs and MINLPs with applications in process design, Computers & Chemical Engineering, 19(5), 551-566, 1995.
  40. Sahinidis, N. V. and M. Tawarmalani, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, Journal of Global Optimization, 32, 259-280, 2005.
  41. Sahinidis, N. V., Global optimization and constraint satisfaction: The branch-and-reduce approach, pp. 1-16 in C. Bliek, C. Jermann, and A. Neumaier (eds.), Global Optimization and Constraint Satisfaction, Lecture Notes in Computer Science, Vol. 2861, Springer, Berlin, 2003.
  42. Sahinidis, N. V. (1996) BARON: A general purpose global optimization software package. Journal of Global Optimization 8, (2), 201.
  43. Sawaya, N.W. and I.E. Grossmann, “A Cutting Plane Method for Solving Linear
    Generalized Disjunctive Programming Problems,” Computers and Chemical Engineering, 29, 1891-1913 (2005).
  44. Sawaya, N.W. and I.E. Grossmann, “Computational Implementation of Non-Linear Convex Hull Reformulation,” Computers & Chemical Engineering, 31, 856-866 (2007).
  45. Saxena, A., Pierre Bonami and Jon Lee. Disjunctive cuts for non-convex mixed integer quadratically constrained programs, In: Integer programming and combinatorial optimization (Bertinoro, 2008), A. Lodi, A. Panconesi, and G. Rinaldi, Eds., Lecture Notes in Computer Science volume 5035, pp. 17-33. Springer-Verlag Berlin Heidelberg, 2008.
  46. Saxena, A., Pierre Bonami and Jon Lee. Convex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Programs: Extended Formulations, IBM Research Report RC24621, 08/2008. To appear in Mathematical Programming.
  47. Saxena, A., Pierre Bonami and Jon Lee. Convex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Programs: Projected Formulations, IBM Research Report RC24695, 11/2008.
  48. Shectman, J. P. and N. V. Sahinidis, A finite algorithm for global minimization of separable concave programs, Journal of Global Optimization, 12(1), 1-36, 1998.
  49. Smith, E. M. B.; Pantelides, C. C. (1999) A symbolic reformulation/spatial branch and bound algorithm for the global optimization of nonconvex MINLPs. Computers & Chemical Engineering 23, 457.
  50. Tawarmalani, M. and N. V. Sahinidis, A polyhedral branch-and-cut approach to global optimization, Mathematical Programming, Ser. B, 103, 225-249, 2005.
  51. Tawarmalani, M.; Sahinidis, N. V. (2004) Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Mathematical Programming 99, 563.
  52. Tawarmalani, M., Sahinidis, N. (2002) Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. , Kluwer Academic Publishers 
  53. Tawarmalani, M., S. Ahmed, and N. V. Sahinidis, Product disaggregation and relaxations of mixed-integer rational programs, Optimization and Engineering, 3(3), 281-303, 2002.
  54. Tawarmalani, M., S. Ahmed, and N. V. Sahinidis, Global optimization of 0-1 hyperbolic programs, Journal of Global Optimization, 24(4), 385-417, 2002.
  55. Tawarmalani, M. and N. V. Sahinidis, Convex extensions and envelopes of lower semi-continuous functions, Mathematical Programming, Ser. A, 93(2), 247-263, 2002.
  56. Tawarmalani, M. and N. V. Sahinidis, Semidefinite relaxations of fractional programs via novel convexification techniques, Journal of Global Optimization, 20(2), 137-158, 2001.
  57. Turkay, M. and I.E. Grossmann, "Logic-Based MINLP Algorithms For the Optimal Synthesis Of Process Networks," Computers and Chemical Engineering , 20, 959- 978 (1996).
  58. Vecchietti, A., Lee, S. , Grossmann, I. E. (2003) Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations. Computers and Chemical Engineering 27,  433-448
  59. Viswanathan, J.; Grossmann, I. E. (1990) A combined penalty-function and outer-approximation method for MINLP optimization. Computers & Chemical Engineering 14, (7), 769.
  60. Westerlund, T.; Pettersson, F. (1995) A cutting plane method for solving convex MINLP problems. Computers & Chemical Engineering 19, S131.
  61. Westerlund T. and Paorn R. (2002). Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques. Optimization and Engineering, 3, 253-280.Zamora, J.M. and I.E. Grossmann (1999) "A Branch and Contract Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms," Journal of Global Optimization 14, 217-249.
  62. You, F., P.M. Castro and I.E. Grossmann, “Dinkelbach’s Algorithm as an Efficient Method for Solving a Class of MINLP Models for Large-Scale Cyclic Scheduling Problems,” Computers and Chemical Engineering, 33, 1879-1889 (2009).
  63. Zamora, J.M. and I.E. Grossmann, "A Branch and Contract Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms," Journal of Global Optimization 14, 217-249 (1999).