{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:50:25Z","timestamp":1776441025711,"version":"3.51.2"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030218027","type":"print"},{"value":"9783030218034","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_45","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"448-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Solving Nonconvex MINLP Problems with SHOT"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Lundell","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kronqvist","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","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)","DOI":"10.1080\/10556780903087124"},{"key":"45_CR2","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."},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Bussieck, M.R., Dirkse, S.P., Vigerske, S.: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data. J. Glob. Optim. 59(2), 259\u2013275 (2014)","DOI":"10.1007\/s10898-013-0131-5"},{"key":"45_CR4","unstructured":"GAMS: Solver manuals (2018). \n                    https:\/\/www.gams.com\/latest\/docs\/S_MAIN.html"},{"key":"45_CR5","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 (July 2018)"},{"key":"45_CR6","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)"},{"issue":"1","key":"45_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.11.1.63","volume":"11","author":"O Guieu","year":"1999","unstructured":"Guieu, O., Chinneck, J.W.: Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. Comput. 11(1), 63\u201377 (1999)","journal-title":"INFORMS J. Comput."},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Javaloyes-Ant\u00f3n, J., Kronqvist, J., Caballero, J.A.: Simulation-based optimization of chemical processes using the extended cutting plane algorithm. In: Friedl, A., Kleme\u0161, J.J., Radl, S., Varbanov, P.S., Wallek, T. (eds.) 28th European Symposium on Computer Aided Process Engineering, Computer Aided Chemical Engineering, vol.\u00a043, pp. 463\u2013469. Elsevier (2018)","DOI":"10.1016\/B978-0-444-64235-6.50083-8"},{"key":"45_CR9","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. Comput. Chem. Eng. (2018)","DOI":"10.1016\/j.compchemeng.2018.06.019"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E.: A review and comparison of solvers for convex MINLP. Optim. Eng. 1\u201359 (2018)","DOI":"10.1007\/s11081-018-9411-8"},{"issue":"2","key":"45_CR11","doi-asserted-by":"crossref","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)","journal-title":"J. Glob. Optim."},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: Reformulations for utilizing separability when solving convex MINLP problems. J. Glob. Optim. 1\u201322 (2018)","DOI":"10.1007\/s10898-018-0616-3"},{"key":"45_CR13","unstructured":"Lastusilta, T.: GAMS MINLP solver comparisons and some improvements to the AlphaECP algorithm. Ph.D. thesis, \u00c5bo Akademi University (2011)"},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Lundell, A., Westerlund, T.: Solving global optimization problems using reformulations and signomial transformations. Comput. Chem. Eng. (2017). (available online)","DOI":"10.1016\/j.compchemeng.2017.10.035"},{"key":"45_CR15","unstructured":"Lundell, A., Kronqvist, J., Westerlund, T.: The supporting hyperplane optimization toolkit-a polyhedral outer approximation based convex MINLP solver utilizing a single branching tree approach. Preprint, Optimization Online (2018)"},{"issue":"1","key":"45_CR16","doi-asserted-by":"crossref","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. Glob. Optim. 57(1), 115\u2013141 (2013)","journal-title":"J. Glob. Optim."},{"key":"45_CR17","unstructured":"MINLPLib: Mixed-integer nonlinear programming library (2018). \n                    http:\/\/www.minlplib.org\/\n                    \n                  . Accessed 27 May 2018"},{"issue":"2\u20133","key":"45_CR18","doi-asserted-by":"crossref","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. Glob. Optim. 59(2\u20133), 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"45_CR19","unstructured":"Mittelmann, H.: Benchmarks for optimization software (2018). \n                    http:\/\/plato.asu.edu\/bench.html\n                    \n                  . Accessed 28 Jan 2019"},{"key":"45_CR20","doi-asserted-by":"crossref","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":"45_CR21","doi-asserted-by":"crossref","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. Glob. Optim. 70(3), 497\u2013516 (2018)","journal-title":"J. Glob. Optim."}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:49:46Z","timestamp":1572587386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_45","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}