{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T20:58:22Z","timestamp":1783803502207,"version":"3.55.0"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T00:00:00Z","timestamp":1616198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T00:00:00Z","timestamp":1616198400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Abo Akademi University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Different versions of polyhedral outer approximation are used by many algorithms for mixed-integer nonlinear programming (MINLP). While it has been demonstrated that such methods work well for convex MINLP, extending them to solve nonconvex problems has traditionally been challenging. The Supporting Hyperplane Optimization Toolkit (SHOT) is a solver based on polyhedral approximations of the nonlinear feasible set of MINLP problems. SHOT is an open source COIN-OR project, and is currently one of the most efficient global solvers for convex MINLP. In this paper, we discuss some extensions to SHOT that significantly extend its applicability to nonconvex problems. The functionality include utilizing convexity detection for selecting the nonlinearities to linearize, lifting reformulations for special classes of functions, feasibility relaxations for infeasible subproblems and adding objective cuts to force the search for better feasible solutions. This functionality is not unique to SHOT, but can be implemented in other similar methods as well. In addition to discussing the new nonconvex functionality of SHOT, an extensive benchmark of deterministic solvers for nonconvex MINLP is performed that provides a snapshot of the current state of nonconvex MINLP.<\/jats:p>","DOI":"10.1007\/s10898-021-01006-1","type":"journal-article","created":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T05:06:48Z","timestamp":1616216808000},"page":"863-896","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1548-1893","authenticated-orcid":false,"given":"Andreas","family":"Lundell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0299-5745","authenticated-orcid":false,"given":"Jan","family":"Kronqvist","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,20]]},"reference":[{"issue":"1","key":"1006_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11590-016-1046-0","volume":"11","author":"P Belotti","year":"2017","unstructured":"Belotti, P., Berthold, T.: Three ideas for a feasibility pump for nonconvex MINLP. Optim. Lett. 11(1), 3\u201315 (2017)","journal-title":"Optim. Lett."},{"key":"1006_CR2","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1006_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1080\/10556788.2019.1641498","volume":"35","author":"DE Bernal","year":"2020","unstructured":"Bernal, D.E., Vigerske, S., Trespalacios, F., Grossmann, I.E.: Improving the performance of DICOPT in convex MINLP problems using a feasibility pump. Optim. Methods Softw. 35(1), 171\u2013190 (2020)","journal-title":"Optim. Methods Softw."},{"key":"1006_CR4","unstructured":"Berthold, T.: Heuristic algorithms in global MINLP solvers. Ph.D. thesis, Technische Universit\u00e4t Berlin (2014)"},{"key":"1006_CR5","doi-asserted-by":"crossref","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: Mixed integer nonlinear programming, pp. 1\u201339. Springer (2012)","DOI":"10.1007\/978-1-4614-1927-3_1"},{"key":"1006_CR6","first-page":"1","volume":"4","author":"P Bonami","year":"2007","unstructured":"Bonami, P., Lee, J.: BONMIN user\u2019s manual. Numer. Math. 4, 1\u201332 (2007)","journal-title":"Numer. Math."},{"issue":"3","key":"1006_CR7","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.ejor.2015.12.018","volume":"252","author":"F Boukouvala","year":"2016","unstructured":"Boukouvala, F., Misener, R., Floudas, C.A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO. Eur. J. Op. Res. 252(3), 701\u2013727 (2016)","journal-title":"Eur. J. Op. Res."},{"issue":"2","key":"1006_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10898-013-0131-5","volume":"59","author":"MR Bussieck","year":"2014","unstructured":"Bussieck, M.R., Dirkse, S.P., Vigerske, S.: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data. J. Global Optim. 59(2), 259\u2013275 (2014)","journal-title":"J. Global Optim."},{"key":"1006_CR9","doi-asserted-by":"crossref","unstructured":"Bussieck, M.R., Vigerske, S.: MINLP solver software. In: Wiley encyclopedia of operations research and management science. Wiley Online Library (2010)","DOI":"10.1002\/9780470400531.eorms0527"},{"key":"1006_CR10","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.compchemeng.2014.03.025","volume":"72","author":"PM Castro","year":"2015","unstructured":"Castro, P.M.: Tightening piecewise mccormick relaxations for bilinear problems. Comput. Chem. Eng. 72, 300\u2013311 (2015)","journal-title":"Comput. Chem. Eng."},{"key":"1006_CR11","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s11590-019-01396-y","volume":"14","author":"F Ceccon","year":"2019","unstructured":"Ceccon, F., Siirola, J.D., Misener, R.: SUSPECT: MINLP special structure detector for pyomo. Optimization Letters 14, 801\u2013814 (2019)","journal-title":"Optimization Letters"},{"issue":"3","key":"1006_CR12","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. Comput. J. 8(3), 250\u2013255 (1965)","journal-title":"Comput. J."},{"issue":"2","key":"1006_CR13","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10107-012-0608-x","volume":"136","author":"C D\u2019Ambrosio","year":"2012","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136(2), 375\u2013402 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"1006_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10479-012-1272-5","volume":"204","author":"C D\u2019Ambrosio","year":"2013","unstructured":"D\u2019Ambrosio, C., Lodi, A.: Mixed integer nonlinear programming tools: an updated practical overview. Ann. Op. Res. 204(1), 301\u2013320 (2013)","journal-title":"Ann. Op. Res."},{"issue":"2","key":"1006_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"issue":"3","key":"1006_CR16","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. Program. 36(3), 307\u2013339 (1986)","journal-title":"Math. Program."},{"issue":"1","key":"1006_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.orl.2009.09.005","volume":"38","author":"C D\u2019Ambrosio","year":"2010","unstructured":"D\u2019Ambrosio, C., Lodi, A., Martello, S.: Piecewise linear approximation of functions of two variables in MILP models. Op. Res. Lett. 38(1), 39\u201346 (2010)","journal-title":"Op. Res. Lett."},{"issue":"1","key":"1006_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91\u2013104 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"1006_CR19","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1016\/j.ejor.2019.09.043","volume":"282","author":"M Fischetti","year":"2020","unstructured":"Fischetti, M., Monaci, M.: A branch-and-cut algorithm for mixed-integer bilinear programming. Eur. J. Op. Res. 282(2), 506\u2013514 (2020)","journal-title":"Eur. J. Op. Res."},{"issue":"1","key":"1006_CR20","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66(1), 327\u2013349 (1994)","journal-title":"Math. Program."},{"key":"1006_CR21","doi-asserted-by":"crossref","unstructured":"Floudas, C.A.: Deterministic global optimization, vol. 37 of nonconvex optimization and its applications (2000)","DOI":"10.1007\/978-1-4757-4949-6"},{"key":"1006_CR22","volume-title":"AMPL","author":"R Fourer","year":"1993","unstructured":"Fourer, R., Gay, D., Kernighan, B.: AMPL. Boyd & Fraser Danvers, MA (1993)"},{"key":"1006_CR23","unstructured":"GAMS: Solver manuals (2018). https:\/\/www.gams.com\/latest\/docs\/S_MAIN.html"},{"issue":"4","key":"1006_CR24","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"1006_CR25","unstructured":"Gleixner, A., Bastubbe, M., Eifler, L., Gally, T., Gamrath, G., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., L\u00fcbbecke, M.E., Maher, S.J., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schl\u00f6sser, F., Schubert, C., Serrano, F., Shinano, Y., Viernickel, J.M., Walter, M., Wegscheider, F., Witt, J.T., Witzig, J.: The SCIP Optimization Suite 6.0. Technical report, Optimization Online (2018)"},{"issue":"12","key":"1006_CR26","doi-asserted-by":"publisher","first-page":"5742","DOI":"10.1021\/ie8016048","volume":"48","author":"CE Gounaris","year":"2009","unstructured":"Gounaris, C.E., Misener, R., Floudas, C.A.: Computational comparison of piecewise- linear relaxations for pooling problems. Ind. Eng. Chem. Res. 48(12), 5742\u20135766 (2009)","journal-title":"Ind. Eng. Chem. Res."},{"key":"1006_CR27","doi-asserted-by":"crossref","unstructured":"Grossmann, I.E., Kravanja, Z.: Mixed-integer nonlinear programming: A survey of algorithms and applications. In: L.T. Biegler, T.F. Coleman, A.R. Conn, F.N. Santosa (eds.) Large-scale optimization with applications, pp. 73\u2013100. Springer (1997)","DOI":"10.1007\/978-1-4612-1960-6_5"},{"key":"1006_CR28","unstructured":"Grossmann, I.E., Viswanathan, J., Vecchietti, A., Raman, R., Kalvelagen, E., et\u00a0al.: GAMS\/DICOPT: A discrete continuous optimization package. GAMS Corporation Inc (2002)"},{"key":"1006_CR29","unstructured":"Guennebaud, G., Jacob, B., et\u00a0al.: Eigen v3 (2010). http:\/\/eigen.tuxfamily.org"},{"issue":"12","key":"1006_CR30","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"OK Gupta","year":"1985","unstructured":"Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming. Manag. Sci. 31(12), 1533\u20131546 (1985)","journal-title":"Manag. Sci."},{"key":"1006_CR31","unstructured":"Gurobi Optimization: Gurobi optimizer reference manual (2020). https:\/\/www.gurobi.com\/wp-content\/plugins\/hd_documentations\/documentation\/9.0\/refman.pdf"},{"key":"1006_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3226-5","volume-title":"Pyomo-optimization modeling in Python","author":"WE Hart","year":"2012","unstructured":"Hart, W.E., Laird, C.D., Watson, J.P., Woodruff, D.L., Hackebeil, G.A., Nicholson, B.L., Siirola, J.D.: Pyomo-optimization modeling in Python, vol. 67. Springer, Berlin (2012)"},{"issue":"3","key":"1006_CR33","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. Comp. Chem. Eng. 13(3), 307\u2013315 (1989)","journal-title":"Comp. Chem. Eng."},{"key":"1006_CR34","doi-asserted-by":"crossref","unstructured":"Kronqvist, J., Bernal, D., Lundell, A., Westerlund, T.: A center-cut algorithm for quickly obtaining feasible solutions and solving convex MINLP problems. Comp. Chem. Eng. (2018)","DOI":"10.1016\/j.compchemeng.2018.06.019"},{"key":"1006_CR35","doi-asserted-by":"crossref","unstructured":"Kronqvist, J., Bernal, D.E., Grossmann, I.E.: Using regularization and second order information in outer approximation for convex MINLP. Mathematical Programming p. 285-310 (2020)","DOI":"10.1007\/s10107-018-1356-3"},{"key":"1006_CR36","doi-asserted-by":"crossref","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E.: A review and comparison of solvers for convex MINLP. Optimization and Engineering pp. 1\u201359 (2018)","DOI":"10.1007\/s11081-018-9411-8"},{"issue":"2","key":"1006_CR37","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. Global Optim. 64(2), 249\u2013272 (2016)","journal-title":"J. Global Optim."},{"key":"1006_CR38","doi-asserted-by":"crossref","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: A center-cut algorithm for solving convex mixed-integer nonlinear programming problems. In: Computer Aided Chemical Engineering, vol.\u00a040, pp. 2131\u20132136. Elsevier (2017)","DOI":"10.1016\/B978-0-444-63965-3.50357-3"},{"issue":"3","key":"1006_CR39","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10898-018-0616-3","volume":"71","author":"J Kronqvist","year":"2018","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: Reformulations for utilizing separability when solving convex minlp problems. J. Global Optim. 71(3), 571\u2013592 (2018)","journal-title":"J. Global Optim."},{"key":"1006_CR40","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ger, O., Coffrin, C., Hijazi, H., Nagarajan, H.: Juniper: An open-source nonlinear branch-and-bound solver in julia. In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 377\u2013386. Springer International Publishing (2018)","DOI":"10.1007\/978-3-319-93031-2_27"},{"key":"1006_CR41","unstructured":"Lastusilta, T.: GAMS MINLP solver comparisons and some improvements to the AlphaECP algorithm. PhD thesis, \u00c5bo Akademi University (2011)"},{"key":"1006_CR42","doi-asserted-by":"crossref","unstructured":"Leyffer, S., Linderoth, J., Luedtke, J., Miller, A., Munson, T.: Applications and algorithms for mixed integer nonlinear programming. In: Journal of Physics: Conference Series, vol. 180, p. 012014. IOP Publishing (2009)","DOI":"10.1088\/1742-6596\/180\/1\/012014"},{"key":"1006_CR43","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Reformulation techniques in mathematical programming. HDR thesis (2009)","DOI":"10.1016\/j.dam.2008.10.016"},{"key":"1006_CR44","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-01085-9_7","volume-title":"Foundations of Computational Intelligence Volume 3: Global Optimization","author":"L Liberti","year":"2009","unstructured":"Liberti, L., Cafieri, S., Tarissan, F.: Reformulations in mathematical programming: a computational approach. In: Abraham, A., Hassanien, A.E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence Volume 3: Global Optimization, pp. 153\u2013234. Springer, Berlin Heidelberg, Berlin, Heidelberg (2009)"},{"key":"1006_CR45","doi-asserted-by":"crossref","unstructured":"Liberti, L., Nannicini, G., Mladenovi\u0107, N.: A good recipe for solving MINLPs. In: Matheuristics, pp. 231\u2013244. Springer (2009)","DOI":"10.1007\/978-1-4419-1306-7_9"},{"issue":"4\u20135","key":"1006_CR46","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)","journal-title":"Optim. Methods Softw."},{"key":"1006_CR47","unstructured":"Lundell, A.: Transformation techniques for signomial functions in global optimization. Ph.D. thesis, \u00c5bo Akademi University (2009)"},{"key":"1006_CR48","doi-asserted-by":"crossref","unstructured":"Lundell, A., Kronqvist, J.: On solving nonconvex MINLP problems with SHOT. In: World Congress on Global Optimization, pp. 448\u2013457. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-21803-4_45"},{"key":"1006_CR49","volume-title":"The Supporting Hyperplane Optimization Toolkit","author":"A Lundell","year":"2020","unstructured":"Lundell, A., Kronqvist, J., Westerlund, T.: The Supporting Hyperplane Optimization Toolkit. Preprint, Optimization Online (2020)"},{"issue":"1","key":"1006_CR50","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10898-012-9877-4","volume":"57","author":"A Lundell","year":"2013","unstructured":"Lundell, A., Skj\u00e4l, A., Westerlund, T.: A reformulation framework for global optimization. J. Global Optim. 57(1), 115\u2013141 (2013)","journal-title":"J. Global Optim."},{"issue":"2\u20133","key":"1006_CR51","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10898-007-9223-4","volume":"43","author":"A Lundell","year":"2009","unstructured":"Lundell, A., Westerlund, J., Westerlund, T.: Some transformation techniques with applications in global optimization. J. Global Optim. 43(2\u20133), 391\u2013405 (2009)","journal-title":"J. Global Optim."},{"key":"1006_CR52","doi-asserted-by":"crossref","unstructured":"Lundell, A., Westerlund, T.: Representation of the convex envelope of bilinear terms in a reformulation framework for global optimization. In: 12th International Symposium on Process Systems Engineering and 25th European Symposium on Computer Aided Process Engineering, pp. 833\u2013838. Elsevier (2015)","DOI":"10.1016\/B978-0-444-63578-5.50134-1"},{"key":"1006_CR53","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.compchemeng.2017.10.035","volume":"116","author":"A Lundell","year":"2018","unstructured":"Lundell, A., Westerlund, T.: Solving global optimization problems using reformulations and signomial transformations. Comp. Chem. Eng. 116, 122\u2013134 (2018)","journal-title":"Comp. Chem. Eng."},{"key":"1006_CR54","volume-title":"Minotaur: A Mixed-Integer Nonlinear Optimization Toolkit","author":"A Mahajan","year":"2017","unstructured":"Mahajan, A., Leyffer, S., Linderoth, J., Luedtke, J., Munson, T.: Minotaur: A Mixed-Integer Nonlinear Optimization Toolkit. Preprint, Optimization Online (2017)"},{"key":"1006_CR55","doi-asserted-by":"crossref","unstructured":"Melo, W., Fampa, M., Raupp, F.: An overview of MINLP algorithms and their implementation in Muriqui Optimizer. Annals of Operations Research pp. 1\u201325 (2018)","DOI":"10.1007\/s10479-018-2872-5"},{"issue":"4","key":"1006_CR56","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1051\/ro:2004026","volume":"38","author":"F Messine","year":"2004","unstructured":"Messine, F.: Deterministic global optimization using interval constraint propagation techniques. RAIRO Op. Res. 38(4), 277\u2013293 (2004)","journal-title":"RAIRO Op. Res."},{"key":"1006_CR57","unstructured":"MINLPLib: Mixed-integer nonlinear programming library (2020). http:\/\/www.minlplib.org\/. [Downloaded January 6th 2020]"},{"key":"1006_CR58","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10957-009-9626-0","volume":"145","author":"R Misener","year":"2010","unstructured":"Misener, R., Floudas, C.A.: Piecewise-linear approximations of multidimensional functions. J. Optim. Theory Appl. 145, 120\u2013147 (2010)","journal-title":"J. Optim. Theory Appl."},{"issue":"2\u20133","key":"1006_CR59","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: Algorithms for continuous\/integer global optimization of nonlinear equations. J. Global Optim. 59(2\u20133), 503\u2013526 (2014)","journal-title":"J. Global Optim."},{"key":"1006_CR60","unstructured":"Mittelmann, H.: Benchmarks for optimization software (2018). http:\/\/plato.asu.edu\/bench.html. [Accessed 28-Jan-2020]"},{"key":"1006_CR61","doi-asserted-by":"crossref","unstructured":"Muts, P., Nowak, I., Hendrix, E.M.: The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming. Journal of Global Optimization pp. 1\u201322 (2020)","DOI":"10.1007\/s10898-020-00888-x"},{"key":"1006_CR62","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s10898-018-00734-1","volume":"74","author":"H Nagarajan","year":"2019","unstructured":"Nagarajan, H., Lu, M., Wang, S., Bent, R., Sundar, K.: An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs. J. Global Optim. 74, 639\u2013675 (2019)","journal-title":"J. Global Optim."},{"key":"1006_CR63","doi-asserted-by":"crossref","unstructured":"Nowak, I., Breitfeld, N., Hendrix, E.M., Njacheun-Njanzoua, G.: Decomposition-based inner-and outer-refinement algorithms for global optimization. Journal of Global Optimization pp. 1\u201317 (2018)","DOI":"10.1007\/s10898-018-0633-2"},{"issue":"4","key":"1006_CR64","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10898-005-0937-x","volume":"33","author":"H Schichl","year":"2005","unstructured":"Schichl, H., Neumaier, A.: Interval analysis on directed acyclic graphs for global optimization. J. Global Optim. 33(4), 541\u2013562 (2005)","journal-title":"J. Global Optim."},{"key":"1006_CR65","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.compchemeng.2017.10.011","volume":"109","author":"L Su","year":"2018","unstructured":"Su, L., Tang, L., Bernal, D.E., Grossmann, I.E.: Improved quadratic cuts for convex mixed-integer nonlinear programs. Comput. Chem. Eng. 109, 77\u201395 (2018)","journal-title":"Comput. Chem. Eng."},{"key":"1006_CR66","doi-asserted-by":"crossref","unstructured":"Sundar, K., Nagarajan, H., Wang, S., Linderoth, J., Bent, R.: Piecewise polyhedral formulations for a multilinear term (2020)","DOI":"10.1016\/j.orl.2020.12.002"},{"key":"1006_CR67","doi-asserted-by":"crossref","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and global optimization in continuous and mixed-integer nonlinear programming: Theory, algorithms, software, and applications, vol.\u00a065. Springer Science & Business Media (2002)","DOI":"10.1007\/978-1-4757-3532-1"},{"issue":"3","key":"1006_CR68","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99(3), 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"1006_CR69","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, 225\u2013249 (2005)","journal-title":"Math. Program."},{"issue":"7","key":"1006_CR70","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1002\/cite.201400037","volume":"86","author":"F Trespalacios","year":"2014","unstructured":"Trespalacios, F., Grossmann, I.E.: Review of mixed-integer nonlinear and generalized disjunctive programming methods. Chem. Ingenieur Technik 86(7), 991\u20131012 (2014)","journal-title":"Chem. Ingenieur Technik"},{"issue":"3","key":"1006_CR71","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2018","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 (2018)","journal-title":"Optim. Methods Softw."},{"issue":"7","key":"1006_CR72","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/0098-1354(90)87085-4","volume":"14","author":"J Viswanathan","year":"1990","unstructured":"Viswanathan, J., Grossmann, I.E.: A combined penalty function and outer-approximation method for MINLP optimization. Comput. Chem. Eng. 14(7), 769\u2013782 (1990)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"1006_CR73","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 an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"1006_CR74","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Petterson, F.: An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1006_CR75","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1021091110342","volume":"3","author":"T Westerlund","year":"2002","unstructured":"Westerlund, T., P\u00f6rn, R.: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optim. Eng. 3(3), 253\u2013280 (2002)","journal-title":"Optim. Eng."},{"issue":"4","key":"1006_CR76","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1002\/aic.11425","volume":"54","author":"DS Wicaksono","year":"2008","unstructured":"Wicaksono, D.S., Karimi, I.A.: Piecewise milp under- and overestimators for global optimization of bilinear programs. AIChE J. 54(4), 991\u20131008 (2008)","journal-title":"AIChE J."},{"issue":"3","key":"1006_CR77","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10898-017-0559-0","volume":"70","author":"K Zhou","year":"2018","unstructured":"Zhou, K., K\u0131l\u0131n\u00e7, M.R., Chen, X., Sahinidis, N.V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver. J. Global Optim. 70(3), 497\u2013516 (2018)","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01006-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01006-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01006-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T05:35:55Z","timestamp":1675056955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01006-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,20]]},"references-count":77,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1006"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01006-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,20]]},"assertion":[{"value":"16 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}