Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

Optimization Methods and Software

Volumn 30, Issue 1, 2015, Pages 215-249

  Misener, Ruth ^a,b   Smadbeck, James B ^a   Floudas, Christodoulos A ^a  

^a Princeton University   (United States)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

cutting planes; global optimization; quadratically constrained quadratic programming

Indexed keywords

CONSTRAINED OPTIMIZATION; GLOBAL OPTIMIZATION; NONLINEAR EQUATIONS; QUADRATIC PROGRAMMING;

COMPUTATIONAL RESULTS; CUTTING PLANES; GLOBAL OPTIMALITY; HIGH-DIMENSIONAL; MAXIMIZATION PROBLEM; QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING; QUADRATICALLY-CONSTRAINED QUADRATIC PROGRAMS; REFORMULATION LINEARIZATION TECHNIQUE;

INTEGER PROGRAMMING;

EID: 84923604788     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2014.916287     Document Type: Article

References (120)

1. T. Achterberg, T. Berthold, T. Koch, and K.Wolter, Constraint integer programming: A new approach to integrate CP and MIP, in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, A. Lodi, M. Milano, and P. Toth, eds., Springer, Heidelberg, 2008, pp. 50-55.
2. T. Achterberg, SCIP: Solving constraint integer programs, Math. Program. Comput. 1 (2009), pp. 1-41. Available at http://mpc.zib.de/index.php/MPC/article/view/4.
3. W.P.Adams and H.D. Sherali, Linearization strategies for a class of zero-one mixed integer programming problems, Oper. Res. 38 (1990), pp. 217-226.
4. W.P. Adams and T.A. Johnson, Improved linear programming-based lower bounds for the quadratic assignment problem, in Quadratic Assignment and Related Problems: DIMACS Workshop, H.Wolkowicz and P.M. Pardalos, eds., American Mathematical Society, Providence, RI, 1994, pp. 43-75.
5. C.S. Adjiman, I.P. Androulakis, and C.A. Floudas, A global optimization method, BB, for general twice differentiable NLPs-II. Implementation and computational results, Comput. Chem. Eng. 22 (1998), pp. 1159-1179.
6. C.S. Adjiman, S. Dallwig, C.A. Floudas, and A. Neumaier, A global optimization method, BB, for general twice differentiable NLPs-I. Theoretical advances, Comput. Chem. Eng. 22 (1998), pp. 1137-1158.
7. E. Ahmetovíc and I.E. Grossmann, Integrated process water networks design problem (2010), available from CyberInfrastructure for MINLP [www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at www.minlp.org/library/problem/index.php?i=101.
8. E. Ahmetovíc and I.E. Grossmann, Global superstructure optimization for the design of integrated process water networks, AIChE J. 57 (2011), pp. 434-457.
9. I.P. Androulakis, C.D. Maranas, and C.A. Floudas, BB: A global optimization method for general constrained nonconvex problems, J. Glob. Optim. 7 (1995), pp. 337-363.
10. K.M. Anstreicher, Recent advances in the solution of quadratic assignment problems, Math. Program. 97 (2003), pp. 27-42.
11. K.M. Anstreicher, Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming, J. Glob. Optim. 43 (2009), pp. 471-484.
12. K.M. Anstreicher, On convex relaxations for quadratically constrained quadratic programming, Math. Program. 136 (2012), pp. 233-251.
13. C. Audet, P. Hansen, B. Jaumard, and G. Savard, A branch and cut algorithm for nonconvex quadratically constrained quadratic programming, Math. Program. 87 (2000), pp. 131-152.
14. C. Audet, P. Hansen, F. Messine, and J. Xiong, The largest small octagon, J. Combin. Theory Ser.A 98 (2002), pp. 46-59.
15. C. Audet, J. Brimberg, P. Hansen, S. Le Digabel, and N. Mladenovic, Pooling problem: Alternate formulations and solution methods, Manag. Sci. 50 (2004), pp. 761-776.
16. C. Audet, P. Hansen, and F. Messine, The small octagon with longest perimeter, J. Combin. Theory Ser. A 114 (2007), pp. 135-150.
17. R.C. Baliban, J.A. Elia, and C.A. Floudas, Optimization framework for the simultaneous process synthesis, heat and power integration of a thermochemical hybrid biomass, coal, and natural gas facility, Comput. Chem. Eng. 35 (2011), pp. 1647-1690.
18. X. Bao, N.V. Sahinidis, and M. Tawarmalani, Multiterm polyhedral relaxations for nonconvex, quadraticallyconstrained quadratic programs, Optim. Methods Softw. 24 (2009), pp. 485-504.
19. P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter, Branching and bounds tightening techniques for non-convex MINLP, Optim. Methods Softw. 24 (2009), pp. 597-634.
20. T. Berthold, S. Heinz, and S. Vigerske, Extending a CIP framework to solve MIQCPs, in Mixed Integer Nonlinear Programming, J. Lee and S. Leyffer, eds., TheIMAVolumes in Mathematics and itsApplications,Vol. 154, Springer, NewYork, 2012, pp. 427-444.
21. T. Berthold, A.M. Gleixner, S. Heinz, and S. Vigerske, Analyzing the computational impact of MIQCP solver components, Numer. Algebra Control Optim. 2 (2012), pp. 739-748.
22. I.M. Bomze, Branch-and-bound approaches to standard quadratic optimization problems, J. Glob. Optim. 22 (2002), pp. 17-37.
23. P. Bonami, L.T. Biegler, A.R. Conn, G. Cornuéjols, I.E. Grossmann, C.D. Laird, J. Lee, A. Lodi, F. Margot, N. Sawaya, and A.Wächter, An algorithmic framework for convex mixed integer nonlinear programs, Discrete Optim. 5 (2008), pp. 186-204.
24. S. Burer and D. Vandenbussche, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, Math. Program. 113 (2008), pp. 259-282.
25. S. Burer and A. Saxena, The MILP road to MIQCP, in Mixed Integer Nonlinear Programming, J. Lee and S. Leyffer, eds., The IMA Volumes in Mathematics and its Applications, Vol. 154, Springer, NewYork, 2012, pp. 373-405.
26. M.R. Bussieck, A.S. Drud, and A. Meeraus, MINLPLib-a collection of test models for mixed-integer nonlinear programming, INFORMS J. Comput. 15 (2003), pp. 114-119.
27. M.R. Bussieck and S. Vigerske, MINLP solver software, inWiley Encyclopedia of Operations Research and Management Science, J.J. Cochran, L.A. Cox, P. Keskinocak, J.P. Kharoufeh, and J.C. Smith, eds., Wiley, Hoboken, 2010, pp. 114-125.
28. R. Carraghan and P.M. Pardalos, An exact algorithm for the maximum clique problem, Oper. Res. Lett. 9 (1990), pp. 375-382.
29. P.M. Castro, H.A. Matos, and A.Q. Novais, An efficient heuristic procedure for the optimal design of wastewater treatment systems, Resour. Conservat. Recycl. 50 (2007), pp. 158-185.
30. P.M. Castro, J.P. Teles, and A.Q. Novais, Linear program-based algorithm for the optimal design of wastewater treatment systems, Clean Technol. Environ. Policy 11 (2009), pp. 83-93.
31. P.M. Castro and J.P. Teles, Comparison of global optimization algorithms for the design of water-using networks, Comput. Chem. Eng. 52 (2013), pp. 249-261.
32. J. Chen and S. Burer, Globally solving nonconvex quadratic programming problems via completely positive programming, Math. Program. Comput. 4 (2012), pp. 33-52.
33. M. Conforti, G. Cornuéjols, A. Kapoor, and K.Vuškovíc, Balanced {0,±1t} matrices II. Recognition algorithm, J. Combin. Theory Ser. B 81 (2001), pp. 275-306.
34. Y. Crama, Recognition problems for special classes of polynomials in 01 variables, Math. Program. 44 (1989), pp. 139-155.
35. Y. Crama, Concave extensions for nonlinear 0-1 maximization problems, Math. Program. 61 (1993), pp. 53-60.
36. J. De Loera, J. Rambau, and F. Santos, Triangulations: Structures for Algorithms and Applications, Algorithms and Computation in Mathematics, Springer, Heidelberg, 2010.
37. E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Program. 91 (2002), pp. 201-213.
38. A. Drud, Conopt (2012). Available at http://www.gams.com/dd/docs/solvers/conopt.pdf.
39. J.A. Elia, R.C. Baliban, and C.A. Floudas, Toward novel hybrid biomass, coal, and natural gas processes for satisfying current transportation fuel demands, 2: Simultaneous heat and power integration, Ind. Eng. Chem. Res. 49 (2010), pp. 7371-7388.
40. C.A. Floudas, Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications, Oxford University Press, NewYork, NY 1995.
41. C.A. Floudas, P.M. Pardalos, C.S. Adjiman,W.R. Esposito, Z.H. Gümüs, S.T. Harding, J.L. Klepeis, C.A. Meyer, and C.A. Schweiger, Handbook of Test Problems in Local and Global Optimization, Kluwer Academic Publishers, Dordrecht, 1999.
42. C.A. Floudas, Deterministic Global Optimization: Theory, Methods and Applications, Nonconvex Optimization and its Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.
43. C.A. Floudas, I.G. Akrotirianakis, S. Caratzoulas, C.A. Meyer, and J. Kallrath, Global optimization in the 21st century: Advances and challenges, Comput. Chem. Eng. 29 (2005), pp. 1185-1202.
44. C.A. Floudas and C.E. Gounaris, A review of recent advances in global optimization, J. Glob. Optim. 45 (2009), pp. 3-38.
45. O. Günlük, J. Lee, and J. Leung, A polytope for a product of real linear functions in 0/1 variables, in Mixed Integer Nonlinear Programming, J. Lee and S. Leyffer, eds., The IMA Volumes in Mathematics and its Applications, Vol. 154, Springer, NewYork, NY, 2012, pp. 513-529.
46. C.Y. Gau and L.E. Schrage, Implementation and testing of a branch-and-bound based method for deterministic global optimization: Operations research applications, in Frontiers in Global Optimization, C.A. Floudas and P.M. Pardalos, eds., Kluwer Academic Publishers, Dordrecht, 2003, pp. 145-164.
47. S. Gerschgorin, Über die abgrenzung der eigenwerte einer matrix, Izv. Akad. Nauk SSSR, Ser, Fiz. mat. 6 (1931), pp. 749-754.
48. A.M. Gleixner and S.Weltge, Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming, in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, C. Gomes and M. Sellmann, eds., Lecture Notes in Computer Science,Vol. 7874, Springer, Heidelberg, 2013, pp. 355-361.
49. J. Hasselberg, P.M. Pardalos, and G.Vairaktarakis, Test case generators and computational results for the maximum clique problem, J. Glob. Optim. 3 (1993), pp. 463-482.
50. R. Horst and T. Hoang, Global optimization: Deterministic Approaches, Springer, Heidelberg, 1996.
51. M. Jünger and V. Kaibel, Box-inequalities for quadratic assignment polytopes, Math. Program. 91 (2001), pp. 175-197.
52. D.R. Jones, A fully general, exact algorithm for nesting irregular shapes, J. Glob. Optim. in press, doi:10.1007/ s10898-013-0129-z
53. J. Kallrath, Cutting circles and polygons from area-minimizing rectangles, J. Glob. Optim. 43 (2009), pp. 299-328.
54. R. Karuppiah and I.E. Grossmann, Global optimization for the synthesis of integrated water systems in chemical processes, Comput. Chem. Eng. 30 (2006), pp. 650-673.
55. J.L. Klepeis, C.A. Floudas, D. Morikis, C.G. Tsokos, and J.D. Lambris, Design of peptide analogues with improved activity using a novel de novo protein design approach, Ind. Eng. Chem. Res. 43 (2004), pp. 3817-3826.
56. S.P. Kolodziej, P.M. Castro, and I.E. Grossmann, Global optimization of bilinear programs with a multiparametric disaggregation technique, J. Glob. Optim. 57 (2013), pp. 1039-1063.
57. S.P. Kolodziej, I.E. Grossmann, K.C. Furman, and N.W. Sawaya, A discretization-based approach for the optimization of the multiperiod blend scheduling problem, Comput. Chem. Eng. 53 (2013), pp. 122-142.
58. H. Lee, J.M. Pinto, I.E. Grossmann, and S. Park, Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management, Ind. Eng. Chem. Res. 35 (1996), pp. 1630-1641.
59. J. Li, A. Li, I.A. Karimi, and R. Srinivasan, Improving the robustness and efficiency of crude scheduling algorithms, AIChE J. 53 (2007), pp. 2659-2680.
60. X. Li, E. Armagan, A. Tomasgard, and P.I. Barton, Stochastic pooling problem for natural gas production network design and operation under uncertainty, AIChE J. 57 (2011), pp. 2120-2135.
61. J. Li, R. Misener, and C.A. Floudas, Continuous-time modeling and global optimization approach for scheduling of crude oil operations, AIChE J. 58 (2012), pp. 205-226.
62. X. Li, A. Tomasgard, and P.I. Barton, Decomposition strategy for the stochastic pooling problem, J. Glob. Optim. 54 (2012), pp. 765-790.
63. L. Liberti and C.C. Pantelides, An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms, J. Glob. Optim. 36 (2006), pp. 161-189.
64. Y. Lin and L. Schrage, The global solver in the LINDO API, Optim. Methods Softw. 24 (2009), pp. 657-668.
65. W.B. Liu and C.A. Floudas, A remark on the GOP algorithm for global optimization, J. Glob. Optim. 3 (1993), pp. 519-521.
66. E.M. Loiola, N.M.M. de Abreu, P.O. Boaventura-Netto, P. Hahn, and T. Querido, A survey for the quadratic assignment problem, European J. Oper. Res. 176 (2007), pp. 657-690.
67. R. Lougee-Heimer, The common optimization interface for operations research: Promoting open-source software in the operations research community, IBM J. Res. Dev. 47 (2003), pp. 57-66.
68. J. Luedtke, M. Namazifar, and J. Linderoth, Some results on the strength of relaxations of multilinear functions, Math. Program. 136 (2012), pp. 325-351.
69. C.D. Maranas and C.A. Floudas, Finding all solutions of nonlinearly constrained systems of equations, J. Glob. Optim. 7 (1995), pp. 143-182.
70. C.D. Maranas, I.P. Androulakis, C.A. Floudas, A.J. Berger, and J.M. Mulvey, Solving long-term financial planning problems via global optimization, J. Econom. Dynam. Control 21 (1997), pp. 1405-1425.
71. G.P. McCormick, Computability of global solutions to factorable nonconvex programs: Part 1-convex underestimating problems, Math. Program. 10 (1976), pp. 147-175.
72. A. Meeraus, GLOBALLib, Available at http://www.gamsworld.org/global/globallib.htm.
73. C.A. Meyer and C.A. Floudas, Convex envelopes for edge-concave functions, Math. Program. 103 (2005), pp. 207-224.
74. C.A. Meyer and C.A. Floudas, Global optimization of a combinatorially complex generalized pooling problem, AIChE J. 52 (2006), pp. 1027-1037.
75. R. Misener and C.A. Floudas, A framework for globally optimizing mixed-integer signomial programs, J. Optim. Theory Appl. in press, doi:10.1007/s10957-013-0396-3
76. R. Misener and C.A. Floudas, ANTIGONE: Algorithms for continuous/ integer global optimization of nonlinear equations, J. Glob. Optim. in press, doi:10.1007/s10898-014-0166-2
77. R. Misener, C.E. Gounaris, and C.A. Floudas, Mathematical modeling and global optimization of large-scale extended pooling problems with the (EPA) complex emissions constraints, Comput. Chem. Eng. 34 (2010), pp. 1432-1456.
78. R. Misener, J.P. Thompson, and C.A. Floudas, APOGEE: Global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes, Comput. Chem. Eng. 35 (2011), pp. 876-892.
79. R. Misener and C.A. Floudas, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Math. Program. B 136 (2012), pp. 155-182.
80. R. Misener and C.A. Floudas, GloMIQO: Global mixed-integer quadratic optimizer, J. Glob. Optim. 57 (2013), pp. 3-50.
81. S. Mouret, I.E. Grossmann, and P. Pestiaux, A novel priority-slot based continuous-time formulation for crude-oil scheduling problems, Ind. Eng. Chem. Res. 48 (2009), pp. 8515-8528.
82. S. Mouret and I.E. Grossmann, Crude-oil operations scheduling (2010), available from CyberInfrastructure for MINLP [www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at: www.minlp.org/library/problem/index.php?i=117.
83. T. Niknam, A. Khodaei, and F. Fallahi, A new decomposition approach for the thermal unit commitment problem, Appl. Energy 86 (2009), pp. 1667-1674.
84. I. Nowak, Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming, International Series of Numerical Mathematics, Birkhäuser, Basel, 2005.
85. P.M. Pardalos and J. Xue, The maximum clique problem, J. Glob. Optim. 4 (1994), pp. 301-328.
86. P. Parpas and B. Rustem, Global optimization of the scenario generation and portfolio selection problems, in Computational Science and its Applications-ICCSA 2006, M. Gavrilova, O. Gervasi,V. Kumar, C. Tan, D. Taniar, A. Laganá,Y. Mun, and H. Choo, eds., Lecture Notes in Computer Science,Vol. 3982, Springer, Heidelberg, 2006, pp. 908-917.
87. S. Poljak and H.Wolkowicz, Convex relaxations of (0, 1)-quadratic programming, Math. Oper. Res. 20 (1995), pp. 550-561.
88. A. Qualizza, P. Belotti, and F. Margot, Linear programming relaxations of quadratically constrained quadratic programs, in Mixed Integer Nonlinear Programming, J. Lee and S. Leyffer, eds., The IMAVolumes in Mathematics and its Applications, Vol. 154, Springer, NewYork, 2012, pp. 407-426.
89. A.D. Rikun, A convex envelope formula for multilinear functions, J. Glob. Optim. 10 (1997), pp. 425-437.
90. L. Rios and N.V. Sahinidis, Portfolio optimization for wealth-dependent risk preferences, Ann. Oper. Res. 177 (2010), pp. 63-90.
91. J.P. Ruiz and I.E. Grossmann, Water treatment network design (2009), available from CyberInfrastructure for MINLP [www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at: www.minlp.org/library/problem/index.php?i=24.
92. N.W. Sawaya, Reformulations, relaxations and cutting planes for generalized disjunctive programming, PhD in Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, 2006.
93. A. Saxena, P. Bonami, and J. Lee, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Math. Program. 124 (2010), pp. 383-411.
94. A. Saxena, P. Bonami, and J. Lee, Convex relaxations of non-convex mixed integer quadratically constrained programs: Projected formulations, Math. Program. 130 (2011), pp. 359-413.
95. A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization,Wiley, Chichester, 1998.
96. A. Scozzari and F. Tardella, A clique algorithm for standard quadratic programming, Discrete Appl. Math. 156 (2008), pp. 2439-2448.
97. A. Selot, L.K. Kuok, M. Robinson, T.L. Mason, and P.I. Barton, A short-term operational planning model for natural gas production systems, AIChE J. 54 (2008), pp. 495-515.
98. H.D. Sherali and A. Alameddine, A new reformulation-linearization technique for bilinear programming problems, J. Glob. Optim. 2 (1992), pp. 379-410.
99. H.D. Sherali and C.H. Tuncbilek, A reformulation-convexification approach for solving nonconvex quadraticprogramming problems, J. Glob. Optim. 7 (1995), pp. 1-31.
100. H.D. Sherali, Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets, Acta Math. Vietnam. 22 (1997), pp. 245-270.
101. H.D. Sherali and C.H. Tuncbilek, New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, Oper. Res. Lett. 21 (1997), pp. 1-9.
102. H.D. Sherali and W.P. Adams, A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Nonconvex Optimization and its Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999.
103. G. Strang, Introduction to Linear Algebra, 3rd ed.,Wellesley-Cambridge Press,Wellesley, MA, 2003.
104. F. Tardella, On a class of functions attaining their maximum at the vertices of a polyhedron, Discret. Appl. Math. 22 (1988/1989), pp. 191-195.
105. F. Tardella, On the existence of polyhedral convex envelopes, in Frontiers in Global Optimization, C.A. Floudas and P.M. Pardalos, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2003, pp. 563-573.
106. F. Tardella, Existence and sum decomposition of vertex polyhedral convex envelopes, Optim. Lett. 2 (2008), pp. 363-375.
107. M. Tawarmalani and N.V. Sahinidis, Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Applications, Software, and Applications, Nonconvex Optimization and its Applications, Kluwer Academic Publishers, Norwell, MA, 2002.
108. M. Tawarmalani and N.V. Sahinidis, A polyhedral branch-and-cut approach to global optimization, Math. Program. 103 (2005), pp. 225-249.
109. M. Tawarmalani, J.P.P. Richard, and C. Xiong, Explicit convex and concave envelopes through polyhedral subdivisions, Math. Program. Ser. A 138 (2013), pp. 531-577.
110. J. Teles, P.M. Castro, and A.Q. Novais, LP-based solution strategies for the optimal design of industrial water networks with multiple contaminants, Chem. Eng. Sci. 63 (2008), pp. 376-394.
111. J.P. Teles, P.M. Castro, and H.A. Matos, Global optimization of water networks design using multiparametric disaggregation, Comput. Chem. Eng. 40 (2012), pp. 132-147.
112. K. Truemper, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, J. Combin. Theory Ser. B 32 (1982), pp. 112-139.
113. D. Vandenbussche and G.L. Nemhauser, A branch-and-cut algorithm for nonconvex quadratic programs with box constraints, Math. Program. 102 (2005), pp. 559-575.
114. D.Vandenbussche and G.L. Nemhauser, A polyhedral study of nonconvex quadratic programs with box constraints, Math. Program. 102 (2005), pp. 531-557.
115. F. You and I.E. Grossmann, Mixed-integer nonlinear programming models and algorithms for large-scale supply chain design with stochastic inventory management, Ind. Eng. Chem. Res. 47 (2008), pp. 7802-7817.
116. F.You and I.E. Grossmann, Mixed-integer nonlinear programming models and algorithms for supply chain design with stochastic inventory management (2009), available from CyberInfrastructure for MINLP [www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at: www.minlp.org/library/problem/ index.php?i=30.
117. Q. Zhao, S.E. Karisch, F. Rendl, and H. Wolkowicz, Semidefinite programming relaxations for the quadratic assignment problem, J. Combin. Optim. 2 (1998), pp. 71-109.
118. X. Zheng, X. Sun, and D. Li, Nonconvex quadratically constrained quadratic programming: Best D.C. decompositions and their SDP representations, J. Glob. Optim. 50 (2011), pp. 695-712.
119. E. Zondervan and I.E. Grossmann, A deterministic security constrained unit commitment model (2009), available from CyberInfrastructure for MINLP [www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at: www.minlp.org/library/problem/index.php?i=41.
120. K. Zorn and N.V. Sahinidis, Global optimization of general non-convex problems with intermediate bilinear substructures, Optim. Methods Softw. 29 (2014), pp. 442-462.