{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:33:54Z","timestamp":1774553634465,"version":"3.50.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T00:00:00Z","timestamp":1702512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T00:00:00Z","timestamp":1702512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M14ZAM"],"award-info":[{"award-number":["05M14ZAM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M20ZBM"],"award-info":[{"award-number":["05M20ZBM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006360","name":"Bundesministerium f\u00fcr Wirtschaft und Energie","doi-asserted-by":"publisher","award":["03ET1549D"],"award-info":[{"award-number":["03ET1549D"]}],"id":[{"id":"10.13039\/501100006360","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>For over 10 years, the constraint integer programming framework SCIP has been extended by capabilities for the solution of convex and nonconvex mixed-integer nonlinear programs (MINLPs). With the recently published version\u00a08.0, these capabilities have been largely reworked and extended. This paper discusses the motivations for recent changes and provides an overview of features that are particular to MINLP solving in SCIP. Further, difficulties in benchmarking global MINLP solvers are discussed and a comparison with several state-of-the-art global MINLP solvers is provided.<\/jats:p>","DOI":"10.1007\/s10898-023-01345-1","type":"journal-article","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T04:27:34Z","timestamp":1702528054000},"page":"287-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Global optimization of mixed-integer nonlinear programs with SCIP 8"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-7099","authenticated-orcid":false,"given":"Ksenia","family":"Bestuzheva","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4809-2958","authenticated-orcid":false,"given":"Antonia","family":"Chmiela","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4463-2873","authenticated-orcid":false,"given":"Benjamin","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7892-3951","authenticated-orcid":false,"given":"Felipe","family":"Serrano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2262-0601","authenticated-orcid":false,"given":"Stefan","family":"Vigerske","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8100-6751","authenticated-orcid":false,"given":"Fabian","family":"Wegscheider","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,14]]},"reference":[{"key":"1345_CR1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed Integer Optimization: Fundamentals and Applications","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and Mixed Integer Optimization: Fundamentals and Applications. Oxford University Press, New York (1995)"},{"key":"1345_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-1-4612-1960-6_5","volume-title":"Large-Scale Optimization with Applications, Part II: Optimal Design and Control","author":"IE Grossmann","year":"1997","unstructured":"Grossmann, I.E., Kravanja, Z.: Mixed-integer nonlinear programming: a survey of algorithms and applications. In: Conn, A.R., Biegler, L.T., Coleman, T.F., Santosa, F.N. (eds.) Large-Scale Optimization with Applications, Part II: Optimal Design and Control, pp. 73\u2013100. Springer, New York (1997). https:\/\/doi.org\/10.1007\/978-1-4612-1960-6_5"},{"key":"1345_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-30927-6","volume-title":"Global Optimization: Scientific and Engineering Case Studies Nonconvex Optimization and Its Applications","year":"2006","unstructured":"Pint\u00e9r, J.D. (ed.): Global Optimization: Scientific and Engineering Case Studies Nonconvex Optimization and Its Applications, vol. 85. Springer, New York (2006). https:\/\/doi.org\/10.1007\/0-387-30927-6"},{"issue":"7","key":"1345_CR4","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1002\/cite.201400037","volume":"86","author":"F Trespalacios","year":"2014","unstructured":"Trespalacios, F., Grossmann, I.: Review of mixed-integer nonlinear and generalized disjunctive programming methods. Chemie Ingenieur Technik 86(7), 991\u20131012 (2014). https:\/\/doi.org\/10.1002\/cite.201400037","journal-title":"Chemie Ingenieur Technik"},{"key":"1345_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/9780470400531.eorms0527","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"MR Bussieck","year":"2010","unstructured":"Bussieck, M.R., Vigerske, S.: MINLP solver software. In: Cochran, J.J., Cox, L.A., Jr., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, Hoboken (2010). https:\/\/doi.org\/10.1002\/9780470400531.eorms0527"},{"issue":"3","key":"1345_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0098-1354(89)85008-2","volume":"13","author":"GR Kocis","year":"1989","unstructured":"Kocis, G.R., Grossmann, I.E.: Computational experience with DICOPT: solving MINLP problems in process systems engineering. Comput. Chem. Eng. 13(3), 307\u2013315 (1989). https:\/\/doi.org\/10.1016\/0098-1354(89)85008-2","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1345_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programm. 36(3), 307\u2013339 (1986). https:\/\/doi.org\/10.1007\/BF02592064","journal-title":"Math. Programm."},{"issue":"1","key":"1345_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00121749","volume":"9","author":"CS Adjiman","year":"1996","unstructured":"Adjiman, C.S., Floudas, C.A.: Rigorous convex underestimators for general twice-differentiable problems. J. Glob. Optim. 9(1), 23\u201340 (1996). https:\/\/doi.org\/10.1007\/BF00121749","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1345_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201\u2013205 (1996). https:\/\/doi.org\/10.1007\/BF00138693","journal-title":"J. Glob. Optim."},{"issue":"4\u20135","key":"1345_CR10","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/s0098-1354(98)00286-5","volume":"23","author":"EMB Smith","year":"1999","unstructured":"Smith, E.M.B., Pantelides, C.C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23(4\u20135), 457\u2013478 (1999). https:\/\/doi.org\/10.1016\/s0098-1354(98)00286-5","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1345_CR11","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2017","unstructured":"Vigerske, S., Gleixner, A.: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3), 563\u2013593 (2017). https:\/\/doi.org\/10.1080\/10556788.2017.1335312","journal-title":"Optim. Methods Softw."},{"key":"1345_CR12","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"1345_CR13","unstructured":"Pfetsch, M.: SCIP: past, present, future. Presentation at workshop Let\u2019s SCIP it! (2022). https:\/\/scipopt.org\/20years\/slides\/pfetsch.pdf"},{"key":"1345_CR14","doi-asserted-by":"crossref","unstructured":"Bestuzheva, K., Chmiela, A., M\u00fcller, B., Serrano, F., Vigerske, S., Wegscheider, F.: Global optimization of mixed-integer nonlinear programs with SCIP 8.0. Technical report (2022). https:\/\/optimization-online.org\/?p=21314","DOI":"10.1007\/s10898-023-01345-1"},{"key":"1345_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492913000032","volume":"22","author":"P Belotti","year":"2013","unstructured":"Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-integer nonlinear optimization. Acta Numer. 22, 1\u2013131 (2013). https:\/\/doi.org\/10.1017\/S0962492913000032","journal-title":"Acta Numer."},{"key":"1345_CR16","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., Hulst, R., Koch, T., L\u00fcbbecke, M., Maher, S.J., Matter, F., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, S., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, P., Weninger, D., Witzig, J.: The SCIP optimization suite 8.0. ZIB report 21\u201341, Zuse Institute Berlin (2021). nbn:de:0297-zib-85309"},{"key":"1345_CR17","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-030-73879-2_10","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Chmiela","year":"2021","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: On the implementation and strengthening of intersection cuts for QCQPs. In: Singh, M., Williamson, D.P. (eds.) Integer Programming and Combinatorial Optimization, pp. 134\u2013147. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73879-2_10"},{"key":"1345_CR18","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-031-32726-1_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"K Bestuzheva","year":"2023","unstructured":"Bestuzheva, K., Gleixner, A., Achterberg, T.: Efficient separation of RLT cuts for implicit and explicit bilinear products. In: Del Pia, A., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization, pp. 14\u201328. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-32726-1_2"},{"issue":"4","key":"1345_CR19","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s12532-023-00246-4","volume":"15","author":"K Bestuzheva","year":"2023","unstructured":"Bestuzheva, K., Gleixner, A., Vigerske, S.: A computational study of perspective cuts. Math. Program. Comput. 15(4), 703\u2013731 (2023). https:\/\/doi.org\/10.1007\/s12532-023-00246-4","journal-title":"Math. Program. Comput."},{"key":"1345_CR20","unstructured":"Wegscheider, F.: Exploiting symmetry in mixed-integer nonlinear programming. Master\u2019s thesis, Zuse Institute Berlin (2019). nbn:de:0297-zib-77055"},{"key":"1345_CR21","volume-title":"Interval Analysis","author":"RE Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis. Prentice Hall, Englewood Cliffs, NJ (1966)"},{"issue":"1","key":"1345_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/bf01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I\u2014convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/bf01580665","journal-title":"Math. Program."},{"key":"1345_CR23","unstructured":"Fletcher, R., Leyffer, S.: User manual for filterSQP. Numerical Analysis Report NA\/181, Department of Mathematics, University of Dundee, Scotland (1998)"},{"issue":"1","key":"1345_CR24","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"key":"1345_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4614-4469-5_4","volume-title":"Modeling and Optimization in Space Engineering. Springer Optimization and Its Applications","author":"C B\u00fcskens","year":"2013","unstructured":"B\u00fcskens, C., Wassel, D.: The ESA NLP solver WORHP. In: Fasano, G., Pint\u00e9r, J.D. (eds.) Modeling and Optimization in Space Engineering. Springer Optimization and Its Applications, vol. 73, pp. 85\u2013110. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-4469-5_4"},{"key":"1345_CR26","unstructured":"Bell, B.: CppAD: a Package for Differentiation of C++ Algorithms. https:\/\/github.com\/coin-or\/CppAD\/"},{"issue":"3","key":"1345_CR27","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","volume":"40","author":"P Hansen","year":"1993","unstructured":"Hansen, P., Jaumard, B., Ruiz, M., Xiong, J.: Global minimization of indefinite quadratic functions subject to box constraints. Naval Res. Logist. (NRL) 40(3), 373\u2013392 (1993). https:\/\/doi.org\/10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","journal-title":"Naval Res. Logist. (NRL)"},{"key":"1345_CR28","doi-asserted-by":"publisher","unstructured":"Berthold, T., Heinz, S., Pfetsch, M.E.: Nonlinear pseudo-boolean optimization: relaxation or propagation? In: Kullmann, O. (ed.) Theory and Applications of Satisfiability Testing\u2014SAT 2009, pp. 441\u2013446. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_40","DOI":"10.1007\/978-3-642-02777-2_40"},{"key":"1345_CR29","unstructured":"Maher, S.J., Fischer, T., Gally, T., Gamrath, G., Gleixner, A., Gottwald, R.L., Hendel, G., Koch, T., L\u00fcbbecke, M.E., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schenker, S., Schwarz, R., Serrano, F., Shinano, Y., Weninger, D., Witt, J.T., Witzig, J.: The SCIP optimization suite 4.0. ZIB report 17\u201312, Zuse Institute Berlin (2017). nbn:de:0297-zib-62170"},{"key":"1345_CR30","unstructured":"Fischer, T.: Branch-and-cut for complementarity and cardinality constrained linear programs. PhD thesis, Technical University of Darmstadt (2017)"},{"issue":"1","key":"1345_CR31","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10107-018-1239-7","volume":"175","author":"C Hojny","year":"2019","unstructured":"Hojny, C., Pfetsch, M.E.: Polytopes associated with symmetry handling. Math. Program. 175(1), 197\u2013240 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1239-7","journal-title":"Math. Program."},{"key":"1345_CR32","unstructured":"Gleixner, A., Eifler, L., Gally, T., Gamrath, G., Gemander, P., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Viernickel, J.M., Vigerske, S., Weninger, D., Witt, J.T., Witzig, J.: The SCIP optimization suite 5.0. ZIB report 17\u201361, Zuse Institute Berlin (2017). nbn:de:0297-zib-66297"},{"key":"1345_CR33","unstructured":"Gamrath, G., Anderson, D., Bestuzheva, K., Chen, W.-K., Eifler, L., Gasse, M., Gemander, P., Gleixner, A., Gottwald, L., Halbig, K., Hendel, G., Hojny, C., Koch, T., Bodic, P.L., Maher, S.J., Matter, F., Miltenberger, M., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Tawfik, C., Vigerske, S., Wegscheider, F., Weninger, D., Witzig, J.: The SCIP optimization suite 7.0. ZIB report 20\u201310, Zuse Institute Berlin (2020). nbn:de:0297-zib-78023"},{"key":"1345_CR34","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"50 Years of Integer Programming","author":"F Margot","year":"2010","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming, pp. 647\u2013686. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_17"},{"issue":"1","key":"1345_CR35","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10107-010-0351-0","volume":"131","author":"L Liberti","year":"2012","unstructured":"Liberti, L.: Reformulations in mathematical programming: automatic symmetry detection and exploitation. Math. Program. 131(1), 273\u2013304 (2012). https:\/\/doi.org\/10.1007\/s10107-010-0351-0","journal-title":"Math. Program."},{"issue":"3","key":"1345_CR36","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/s10601-009-9076-1","volume":"15","author":"F Domes","year":"2010","unstructured":"Domes, F., Neumaier, A.: Constraint propagation on quadratic constraints. Constraints 15(3), 404\u2013429 (2010). https:\/\/doi.org\/10.1007\/s10601-009-9076-1","journal-title":"Constraints"},{"issue":"2","key":"1345_CR37","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10898-018-0626-1","volume":"72","author":"M Locatelli","year":"2018","unstructured":"Locatelli, M.: Convex envelopes of bivariate functions through the solution of KKT systems. J. Glob. Optim. 72(2), 277\u2013303 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0626-1","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1345_CR38","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1137\/19m1249825","volume":"30","author":"B M\u00fcller","year":"2020","unstructured":"M\u00fcller, B., Serrano, F., Gleixner, A.: Using two-dimensional projections for stronger separation and propagation of bilinear terms. SIAM J. Optim. 30(2), 1339\u20131365 (2020). https:\/\/doi.org\/10.1137\/19m1249825","journal-title":"SIAM J. Optim."},{"issue":"10","key":"1345_CR39","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams, W.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32(10), 1274\u20131290 (1986). https:\/\/doi.org\/10.1287\/mnsc.32.10.1274","journal-title":"Manag. Sci."},{"issue":"2","key":"1345_CR40","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"WP Adams","year":"1990","unstructured":"Adams, W.P., Sherali, H.D.: Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 38(2), 217\u2013226 (1990). https:\/\/doi.org\/10.1287\/opre.38.2.217","journal-title":"Oper. Res."},{"issue":"1","key":"1345_CR41","first-page":"32","volume":"159","author":"H Tuy","year":"1964","unstructured":"Tuy, H.: Concave programming with linear constraints. Doklady Akademii Nauk 159(1), 32\u201335 (1964)","journal-title":"Doklady Akademii Nauk"},{"issue":"1","key":"1345_CR42","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts\u2014a new type of cutting planes for integer programming. Oper. Res. 19(1), 19\u201339 (1971). https:\/\/doi.org\/10.1287\/opre.19.1.19","journal-title":"Oper. Res."},{"key":"1345_CR43","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-45771-6_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Mu\u00f1oz","year":"2020","unstructured":"Mu\u00f1oz, G., Serrano, F.: Maximal quadratic-free sets. In: Bienstock, D., Zambelli, G. (eds.) Integer Programming and Combinatorial Optimization, pp. 307\u2013321. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_24"},{"key":"1345_CR44","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF02026599","volume":"18","author":"F Glover","year":"1974","unstructured":"Glover, F.: Polyhedral convexity cuts and negative edge extensions. Z. f\u00fcr Oper. Res. 18, 181\u2013186 (1974). https:\/\/doi.org\/10.1007\/BF02026599","journal-title":"Z. f\u00fcr Oper. Res."},{"issue":"1","key":"1345_CR45","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10107-012-0555-6","volume":"136","author":"R Misener","year":"2012","unstructured":"Misener, R., Floudas, C.A.: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. Math. Program. 136(1), 155\u2013182 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0555-6","journal-title":"Math. Program."},{"issue":"1","key":"1345_CR46","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/10556788.2014.916287","volume":"30","author":"R Misener","year":"2015","unstructured":"Misener, R., Smadbeck, J.B., Floudas, C.A.: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2. Optim. Methods Softw. 30(1), 215\u2013249 (2015). https:\/\/doi.org\/10.1080\/10556788.2014.916287","journal-title":"Optim. Methods Softw."},{"key":"1345_CR47","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-1-4613-0251-3_30","volume-title":"Frontiers in Global Optimization","author":"F Tardella","year":"2004","unstructured":"Tardella, F.: On the existence of polyhedral convex envelopes. In: Floudas, C.A., Pardalos, P. (eds.) Frontiers in Global Optimization, pp. 563\u2013573. Springer, Boston (2004). https:\/\/doi.org\/10.1007\/978-1-4613-0251-3_30"},{"key":"1345_CR48","unstructured":"Mahajan, A., Munson, T.: Exploiting second-order cone structure for global optimization. Technical Report ANL\/MCS-P1801-1010, Argonne National Laboratory (2010)"},{"issue":"3","key":"1345_CR49","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s12532-016-0113-y","volume":"9","author":"JP Vielma","year":"2016","unstructured":"Vielma, J.P., Dunning, I., Huchette, J., Lubin, M.: Extended formulations in mixed integer conic quadratic programming. Math. Program. Comput. 9(3), 369\u2013418 (2016). https:\/\/doi.org\/10.1007\/s12532-016-0113-y","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1345_CR50","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005). https:\/\/doi.org\/10.1007\/s10107-005-0581-8","journal-title":"Math. Program."},{"issue":"2","key":"1345_CR51","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10898-015-0322-3","volume":"64","author":"J Kronqvist","year":"2016","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming. J. Glob. Optim. 64(2), 249\u2013272 (2016). https:\/\/doi.org\/10.1007\/s10898-015-0322-3","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1345_CR52","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1287\/opre.15.1.147","volume":"15","author":"AF Veinott","year":"1967","unstructured":"Veinott, A.F.: The supporting hyperplane method for unimodal programming. Oper. Res. 15(1), 147\u2013152 (1967). https:\/\/doi.org\/10.1287\/opre.15.1.147","journal-title":"Oper. Res."},{"issue":"12","key":"1345_CR53","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1016\/S0098-1354(98)00244-0","volume":"22","author":"JM Zamora","year":"1998","unstructured":"Zamora, J.M., Grossmann, I.E.: Continuous global optimization of structured process systems models. Comput. Chem. Eng. 22(12), 1749\u20131770 (1998). https:\/\/doi.org\/10.1016\/S0098-1354(98)00244-0","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1345_CR54","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0\u20131 mixed integer programs. Math. Program. 106(2), 225\u2013236 (2006). https:\/\/doi.org\/10.1007\/s10107-005-0594-3","journal-title":"Math. Program."},{"issue":"3","key":"1345_CR55","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1021\/ie00015a012","volume":"32","author":"I Quesada","year":"1993","unstructured":"Quesada, I., Grossmann, I.E.: Global optimization algorithm for heat exchanger networks. Ind. Eng. Chem. Res. 32(3), 487\u2013499 (1993). https:\/\/doi.org\/10.1021\/ie00015a012","journal-title":"Ind. Eng. Chem. Res."},{"issue":"4","key":"1345_CR56","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10898-016-0450-4","volume":"67","author":"A Gleixner","year":"2017","unstructured":"Gleixner, A., Berthold, T., M\u00fcller, B., Weltge, S.: Three enhancements for optimization-based bound tightening. J. Glob. Optim. 67(4), 731\u2013757 (2017). https:\/\/doi.org\/10.1007\/s10898-016-0450-4","journal-title":"J. Glob. Optim."},{"issue":"3","key":"1345_CR57","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10589-012-9473-z","volume":"54","author":"L Smith","year":"2013","unstructured":"Smith, L., Chinneck, J., Aitken, V.: Improved constraint consensus methods for seeking feasibility in nonlinear programs. Comput. Optim. Appl. 54(3), 555\u2013578 (2013). https:\/\/doi.org\/10.1007\/s10589-012-9473-z","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1345_CR58","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s12532-018-0141-x","volume":"11","author":"L Schewe","year":"2019","unstructured":"Schewe, L., Schmidt, M.: Computing feasible points for binary MINLPs with MPECs. Math. Program. Comput. 11(1), 95\u2013118 (2019). https:\/\/doi.org\/10.1007\/s12532-018-0141-x","journal-title":"Math. Program. Comput."},{"issue":"1\u20132","key":"1345_CR59","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10107-013-0635-2","volume":"144","author":"T Berthold","year":"2014","unstructured":"Berthold, T., Gleixner, A.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP. Math. Program. 144(1\u20132), 315\u2013346 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0635-2","journal-title":"Math. Program."},{"issue":"3","key":"1345_CR60","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0138-5","journal-title":"Math. Program. Comput."},{"issue":"4\u20135","key":"1345_CR61","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24(4\u20135), 657\u2013668 (2009). https:\/\/doi.org\/10.1080\/10556780902753221","journal-title":"Optim. Methods Softw."},{"key":"1345_CR62","unstructured":"A Library of Mixed-Integer and Continuous Nonlinear Programming Instances. https:\/\/www.minlplib.org (2022-10-14)"},{"key":"1345_CR63","unstructured":"Xu, L., D\u2019Ambrosio, C., Liberti, L., Vanier, S.H.: On cutting planes for extended formulation of signomial programming (2022) arXiv:2212.02857"},{"key":"1345_CR64","unstructured":"Bestuzheva, K., Gleixner, A., V\u00f6lker, H.: Strengthening SONC relaxations with constraints derived from variable bounds. ZIB-Report 23-03, Zuse Institute Berlin (2023). nbn:de:0297-zib-89510"},{"key":"1345_CR65","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-031-32726-1_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Chmiela","year":"2023","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: Monoidal strengthening and unique lifting in MIQCPs. In: Del Pia, A., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization, pp. 87\u201399. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-32726-1_7"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01345-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01345-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01345-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T05:47:57Z","timestamp":1739598477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01345-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,14]]},"references-count":65,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1345"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01345-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,14]]},"assertion":[{"value":"16 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}