{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T20:58:23Z","timestamp":1783803503105,"version":"3.55.0"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T00:00:00Z","timestamp":1644451200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T00:00:00Z","timestamp":1644451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004155","name":"Magnus Ehrnroothin S\u00e4\u00e4ti\u00f6","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004155","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ruth and Nils-Erik Stenb\u00e4ck Foundation"},{"name":"Newton International Fellowship by the Royal Society"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, an open-source solver for mixed-integer nonlinear programming (MINLP) problems is presented. The Supporting Hyperplane Optimization Toolkit (SHOT) combines a dual strategy based on polyhedral outer approximations (POA) with primal heuristics. The POA is achieved by expressing the nonlinear feasible set of the MINLP problem with linearizations obtained with the extended supporting hyperplane (ESH) and extended cutting plane (ECP) algorithms. The dual strategy can be tightly integrated with the mixed-integer programming (MIP) subsolver in a so-called single-tree manner, <jats:italic>i.e.<\/jats:italic>,\u00a0only a single MIP optimization problem is solved, where the polyhedral linearizations are added as lazy constraints through callbacks in the MIP solver. This enables the MIP solver to reuse the branching tree in each iteration, in contrast to most other POA-based methods. SHOT is available as a COIN-OR open-source project, and it utilizes a flexible task-based structure making it easy to extend and modify. It is currently available in GAMS, and can be utilized in AMPL, Pyomo and JuMP as well through its ASL interface. The main functionality and solution strategies implemented in SHOT are described in this paper, and their impact on the performance are illustrated through numerical benchmarks on 406 convex MINLP problems from the MINLPLib problem library. Many of the features introduced in SHOT can be utilized in other POA-based solvers as well. To show the overall effectiveness of SHOT, it is also compared to other state-of-the-art solvers on the same benchmark set.<\/jats:p>","DOI":"10.1007\/s10898-022-01128-0","type":"journal-article","created":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T01:02:21Z","timestamp":1644454941000},"page":"1-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["The supporting hyperplane optimization toolkit for convex MINLP"],"prefix":"10.1007","volume":"84","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"}]},{"given":"Tapio","family":"Westerlund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,2,10]]},"reference":[{"issue":"4","key":"1128_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1287\/ijoc.1090.0373","volume":"22","author":"K Abhishek","year":"2010","unstructured":"Abhishek, K., Leyffer, S., Linderoth, J.: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs. INFORMS J. Comput. 22(4), 555\u2013567 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1128_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1145\/210089.210111","volume":"21","author":"G Alefeld","year":"1995","unstructured":"Alefeld, G., Potra, F.A., Shi, Y.: Algorithm 748: enclosing zeros of continuous functions. ACM Trans. Math. Softw. 21(3), 327\u2013344 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"1128_CR3","unstructured":"Bell, B.M.: Cppad: a package for C++ algorithmic differentiation. Comput. Infrastruct. Oper. Res. 57(10) (2012)"},{"key":"1128_CR4","unstructured":"Belotti, P.: Couenne: A user\u2019s manual. Lehigh University, Technical report (2009)"},{"issue":"1","key":"1128_CR5","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":"1128_CR6","unstructured":"Berthold, T., Lodi, A., Salvagnin, D.: Ten years of feasibility pump and counting. Technical report, Polytechnique Montr\u00e9al, D\u00e9partement de Math\u00e9matiques e G\u00e9nie Industriel (2017)"},{"key":"1128_CR7","unstructured":"Bisschop, J.: AIMMS optimization modeling. Lulu.com (2006)"},{"key":"1128_CR8","doi-asserted-by":"crossref","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008)","DOI":"10.1016\/j.disopt.2006.10.011"},{"issue":"2","key":"1128_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10107-008-0212-2","volume":"119","author":"P Bonami","year":"2009","unstructured":"Bonami, P., Cornu\u00e9jols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Math. Program. 119(2), 331\u2013352 (2009)","journal-title":"Math. Program."},{"key":"1128_CR10","doi-asserted-by":"crossref","unstructured":"Brook, A., Kendrick, D., Meeraus, A.: GAMS, a user\u2019s guide. ACM Signum Newsl. 23(3\u20134), 10\u201311 (1988)","DOI":"10.1145\/58859.58863"},{"issue":"(2\u20133)","key":"1128_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10898-013-0131-5","volume":"59","author":"M Bussieck","year":"2014","unstructured":"Bussieck, M., Dirkse, S., Vigerske, S.: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data. J. Global Optim. 59((2\u20133)), 259\u2013275 (2014)","journal-title":"J. Global Optim."},{"key":"1128_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-1-4613-0215-5_8","volume-title":"Modeling Languages in Mathematical Optimization","author":"MR Bussieck","year":"2004","unstructured":"Bussieck, M.R., Meeraus, A.: General algebraic modeling system (GAMS). In: Kallrath, J. (ed.) Modeling Languages in Mathematical Optimization, pp. 137\u2013157. Springer, Boston (2004)"},{"key":"1128_CR13","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, pp. 1\u201312 (2010)","DOI":"10.1002\/9780470400531.eorms0527"},{"key":"1128_CR14","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. Optim. Lett. 14, 801\u2013814 (2019)","journal-title":"Optim. Lett."},{"issue":"3","key":"1128_CR15","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":"1128_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/ijoc.6.2.207","volume":"6","author":"AS Drud","year":"1994","unstructured":"Drud, A.S.: CONOPT\u2014a large-scale GRG code. ORSA J. Comput. 6(2), 207\u2013216 (1994)","journal-title":"ORSA J. Comput."},{"issue":"2","key":"1128_CR17","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":"1128_CR18","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":"1128_CR19","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":"1128_CR20","doi-asserted-by":"crossref","unstructured":"Forrest, J., Lougee-Heimer, R.: CBC User Guide (2005). http:\/\/www.coin-or.org\/Cbc","DOI":"10.1287\/educ.1053.0020"},{"key":"1128_CR21","unstructured":"Fourer, R., Gay, D., Kernighan, B.: AMPL. Boyd & Fraser Danvers (1993)"},{"issue":"5","key":"1128_CR22","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1287\/mnsc.36.5.519","volume":"36","author":"R Fourer","year":"1990","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: A modeling language for mathematical programming. Manag. Sci. 36(5), 519\u2013554 (1990)","journal-title":"Manag. Sci."},{"issue":"1","key":"1128_CR23","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10589-008-9169-6","volume":"45","author":"R Fourer","year":"2010","unstructured":"Fourer, R., Ma, J., Martin, K.: OSiL: an instance language for optimization. Comput. Optim. Appl. 45(1), 181\u2013203 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"1128_CR24","unstructured":"GAMS Development Corp.: SBB user\u2019s manual (2018). https:\/\/www.gams.com\/latest\/docs\/S_SBB.html"},{"key":"1128_CR25","unstructured":"Gassmann, H., Ma, J., Martin, K., Sheng, W.: Optimization Services 2.10 User\u2019s Manual. http:\/\/projects.coin-or.org\/svn\/OS\/trunk\/OS\/doc\/osUsersManual.pdf (2015)"},{"issue":"4","key":"1128_CR26","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."},{"issue":"3","key":"1128_CR27","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1021039126272","volume":"3","author":"IE Grossmann","year":"2002","unstructured":"Grossmann, I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3(3), 227\u2013252 (2002)","journal-title":"Optim. Eng."},{"key":"1128_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":"1128_CR29","unstructured":"Guennebaud, G., Jacob, B., et\u00a0al.: Eigen v3 (2010). http:\/\/eigen.tuxfamily.org"},{"issue":"12","key":"1128_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":"1128_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3226-5","volume-title":"Pyomo\u2014Optimization Modeling in Python","author":"WE Hart","year":"2012","unstructured":"Hart, W.E., Laird, C., Watson, J.-P., Woodruff, D.L.: Pyomo\u2014Optimization Modeling in Python, 1st edn. Springer, Berlin (2012)","edition":"1"},{"issue":"1","key":"1128_CR32","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/ijoc.1120.0545","volume":"26","author":"H Hijazi","year":"2014","unstructured":"Hijazi, H., Bonami, P., Ouorou, A.: An outer-inner approximation for separable mixed-integer nonlinear programs. INFORMS J. Comput. 26(1), 31\u201344 (2014)","journal-title":"INFORMS J. Comput."},{"key":"1128_CR33","unstructured":"HSL.: A collection of Fortran codes for large-scale scientific computation. http:\/\/www.hsl.rl.ac.uk (2018)"},{"key":"1128_CR34","unstructured":"Hunting, M.: The AIMMS outer approximation algorithm for MINLP. Technical report, AIMMS B.V (2011)"},{"key":"1128_CR35","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ger, O., Coffrin, C., Hijazi, H., Nagarajan, H.: An Open-Source Nonlinear Branch-and-Bound Solver in Julia. arXiv preprint, Juniper, p. 07332 (2018)","DOI":"10.1007\/978-3-319-93031-2_27"},{"key":"1128_CR36","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-018-1356-3","volume":"180","author":"J Kronqvist","year":"2020","unstructured":"Kronqvist, J., Bernal, D.E., Grossmann, I.E.: Using regularization and second order information in outer approximation for convex MINLP. Math. Program. 180, 285\u2013310 (2020)","journal-title":"Math. Program."},{"key":"1128_CR37","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11081-018-9411-8","volume":"20","author":"J Kronqvist","year":"2019","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E.: A review and comparison of solvers for convex MINLP. Optim. Eng. 20, 397\u2013455 (2019)","journal-title":"Optim. Eng."},{"issue":"2","key":"1128_CR38","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10898-015-0322-3","volume":"64","author":"J Kronqvist","year":"2015","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 (2015)","journal-title":"J. Global Optim."},{"key":"1128_CR39","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. Elsevier, pp. 2131\u20132136 (2017)","DOI":"10.1016\/B978-0-444-63965-3.50357-3"},{"key":"1128_CR40","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, 571\u2013592 (2018)","journal-title":"J. Global Optim."},{"issue":"15","key":"1128_CR41","doi-asserted-by":"publisher","first-page":"7337","DOI":"10.1021\/ie801378n","volume":"48","author":"T Lastusilta","year":"2009","unstructured":"Lastusilta, T., Bussieck, M.R., Westerlund, T.: An experimental study of the GAMS\/AlphaECP MINLP solver. Ind. Eng. Chem. Res. 48(15), 7337\u20137345 (2009)","journal-title":"Ind. Eng. Chem. Res."},{"key":"1128_CR42","unstructured":"Leyffer, S.: Deterministic methods for mixed integer nonlinear programming. Ph.D. thesis, University of Dundee (1993)"},{"key":"1128_CR43","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Reformulation techniques in mathematical programming. HDR thesis (2009)","DOI":"10.1016\/j.dam.2008.10.016"},{"issue":"4\u20135","key":"1128_CR44","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":"1128_CR45","doi-asserted-by":"crossref","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Extended formulations in mixed-integer convex programming. In: Louveaux, Q., Skutella, M. (Eds.), Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016. Springer International Publishing, pp. 102\u2013113 (2016)","DOI":"10.1007\/978-3-319-33461-5_9"},{"key":"1128_CR46","unstructured":"Lundell, A.: Transformation techniques for signomial functions in global optimization. Ph.D. thesis, \u00c5bo Akademi University ( 2009)"},{"key":"1128_CR47","unstructured":"Lundell, A., Kronqvist, J., Westerlund, T.: Improvements to the supporting hyperplane optimization toolkit solver for convex MINLP. In: XIII Global Optimization Workshop GOW\u201916. Vol.\u00a016. pp. 101\u2013104 (2016)"},{"key":"1128_CR48","doi-asserted-by":"crossref","unstructured":"Lundell, A., Kronqvist, J., Westerlund, T.: SHOT\u2014a global solver for convex MINLP in Wolfram Mathematica. In: Computer Aided Chemical Engineering. Vol.\u00a040. Elsevier, pp. 2137\u20132142 (2017)","DOI":"10.1016\/B978-0-444-63965-3.50358-5"},{"key":"1128_CR49","unstructured":"Lundell, A., Kronqvist, J., Westerlund, T.: The Supporting Hyperplane Optimization Toolkit. http:\/\/www.github.com\/coin-or\/shot(2018)"},{"issue":"2","key":"1128_CR50","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), 391\u2013405 (2009)","journal-title":"J. Global Optim."},{"key":"1128_CR51","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. Comput. Chem. Eng. 116, 122\u2013134 (2018)","journal-title":"Comput. Chem. Eng."},{"key":"1128_CR52","unstructured":"Mahajan, A., Leyffer, S., Linderoth, J., Luedtke, J., Munson, T.: Minotaur: a mixed-integer nonlinear optimization toolkit. Preprint, Optimization Online. http:\/\/www.optimization-online.org\/DB_FILE\/2017\/10\/6275.pdf (2017)"},{"key":"1128_CR53","doi-asserted-by":"crossref","unstructured":"Melo, W., Fampa, M., Raupp, F.: An overview of MINLP algorithms and their implementation in Muriqui Optimizer. Ann. Oper. Res. 217\u2013241 (2020)","DOI":"10.1007\/s10479-018-2872-5"},{"issue":"4","key":"1128_CR54","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 Oper. Res. 38(4), 277\u2013293 (2004)","journal-title":"RAIRO Oper. Res."},{"key":"1128_CR55","unstructured":"MINLPLib.: Mixed-integer nonlinear programming library. Accessed January 6 http:\/\/www.minlplib.org\/ (2020)"},{"issue":"2\u20133","key":"1128_CR56","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":"1128_CR57","doi-asserted-by":"crossref","unstructured":"Muts, P., Nowak, I., Hendrix, E.M.: The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming. J. Global Optim., 1\u201322 (2020)","DOI":"10.1007\/s10898-020-00888-x"},{"key":"1128_CR58","doi-asserted-by":"crossref","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. (2019)","DOI":"10.1007\/s10898-018-00734-1"},{"key":"1128_CR59","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. J. Global Optim., 305\u2013321 (2018)","DOI":"10.1007\/s10898-018-0633-2"},{"key":"1128_CR60","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0098-1354(98)00305-6","volume":"23","author":"R P\u00f6rn","year":"1999","unstructured":"P\u00f6rn, R., Harjunkoski, I., Westerlund, T.: Convexification of different classes of non-convex MINLP problems. Comput. Chem. Eng. 23, 439\u2013448 (1999)","journal-title":"Comput. Chem. Eng."},{"issue":"10\u201311","key":"1128_CR61","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I Quesada","year":"1992","unstructured":"Quesada, I., Grossmann, I.E.: An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16(10\u201311), 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1128_CR62","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. Global Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"key":"1128_CR63","unstructured":"Sch\u00e4ling, B.: The Boost C++ Libraries (2nd edition). XML Press (2014)"},{"issue":"4","key":"1128_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":"1128_CR65","unstructured":"Slater, M.: Lagrange multipliers revisited. Cowles Foundation for Research in Economics, Yale University, Technical report (1950)"},{"key":"1128_CR66","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":"1128_CR67","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.compchemeng.2015.01.015","volume":"75","author":"L Su","year":"2015","unstructured":"Su, L., Tang, L., Grossmann, I.E.: Computational strategies for improved MINLP algorithms. Comput. Chem. Eng. 75, 40\u201348 (2015)","journal-title":"Comput. Chem. Eng."},{"key":"1128_CR68","unstructured":"Tasseff, B., Coffrin, C., W\u00e4chter, A., Laird, C.: Exploring benefits of linear solver parallelism on modern nonlinear optimization applications (2019)"},{"issue":"2","key":"1128_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(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"issue":"7","key":"1128_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. Ing. Tec. 86(7), 991\u20131012 (2014)","journal-title":"Chem. Ing. Tec."},{"issue":"3","key":"1128_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":"1","key":"1128_CR72","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."},{"issue":"1","key":"1128_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":"1128_CR74","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s10898-018-0644-z","volume":"71","author":"T Westerlund","year":"2018","unstructured":"Westerlund, T., Eronen, V.-P., M\u00e4kel\u00e4, M.M.: On solving generalized convex MINLP problems using supporting hyperplane techniques. J. Global Optim. 71, 981\u20131011 (2018)","journal-title":"J. Global Optim."},{"key":"1128_CR75","unstructured":"Westerlund, T., Lastusilta, T.: AlphaECP GAMS user\u2019s manual (2008). http:\/\/www.gams.com\/latest\/docs\/S_ALPHAECP.html"},{"key":"1128_CR76","unstructured":"Westerlund, T., Lundqvist, K.: Alpha-ECP, an interactive MINLP-solver based on the extended cutting plane method. \u00c5bo Akademi University, Technical report (2005)"},{"key":"1128_CR77","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., Pettersson, F.: An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"1128_CR78","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 problems by cutting plane techniques. Optim. Eng. 3, 253\u2013280 (2002)","journal-title":"Optim. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01128-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01128-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01128-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T13:22:06Z","timestamp":1666531326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01128-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,10]]},"references-count":78,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1128"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01128-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,10]]},"assertion":[{"value":"10 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}