{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:27:50Z","timestamp":1770679670551,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:00:00Z","timestamp":1555372800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:00:00Z","timestamp":1555372800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0014114"],"award-info":[{"award-number":["DE-SC0014114"]}],"id":[{"id":"10.13039\/100000015","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":[[2019,10]]},"DOI":"10.1007\/s10898-019-00769-y","type":"journal-article","created":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:03:10Z","timestamp":1555416190000},"page":"393-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A scalable global optimization algorithm for stochastic nonlinear programs"],"prefix":"10.1007","volume":"75","author":[{"given":"Yankai","family":"Cao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5744-7378","authenticated-orcid":false,"given":"Victor M.","family":"Zavala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,16]]},"reference":[{"issue":"1","key":"769_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"769_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"IP Androulakis","year":"1995","unstructured":"Androulakis, I.P., Maranas, C.D., Floudas, C.A.: $$\\alpha $$bb: a global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7(4), 337\u2013363 (1995)","journal-title":"J. Glob. Optim."},{"key":"769_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming, 2nd edn. Springer, New York (2011)","edition":"2"},{"key":"769_CR4","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2013","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2013)"},{"issue":"1","key":"769_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"CC Car\u00f8E","year":"1999","unstructured":"Car\u00f8E, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1), 37\u201345 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"769_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1023\/A:1022687222060","volume":"95","author":"M D\u00fcr","year":"1997","unstructured":"D\u00fcr, M., Horst, R.: Lagrange duality and partitioning techniques in nonconvex global optimization. J. Optim. Theory Appl. 95(2), 347\u2013369 (1997)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"769_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1008212418949","volume":"11","author":"TG Epperly","year":"1997","unstructured":"Epperly, T.G., Pistikopoulos, E.N.: A reduced space branch and bound algorithm for global optimization. J. Glob. Optim. 11(3), 287\u2013311 (1997)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"769_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Manag. Sci. 27(1), 1\u201318 (1981)","journal-title":"Manag. Sci."},{"issue":"2","key":"769_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00939667","volume":"78","author":"CA Floudas","year":"1993","unstructured":"Floudas, C.A., Visweswaran, V.: Primal-relaxed dual global optimization approach. J. Optim. Theory Appl. 78(2), 187\u2013225 (1993)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"769_CR10","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":"2","key":"769_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition: a model yielding stronger lagrangean bounds. Math. Program. 39(2), 215\u2013228 (1987)","journal-title":"Math. Program."},{"key":"769_CR12","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"2013","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, New York (2013)"},{"key":"769_CR13","doi-asserted-by":"crossref","unstructured":"Jalving, J., Abhyankar, S., Kim, K., Hereld, M., Zavala, V.M.: A graph-based computational framework for simulation and optimization of coupled infrastructure networks. Under Review (2016)","DOI":"10.1049\/iet-gtd.2016.1582"},{"issue":"2","key":"769_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10898-007-9203-8","volume":"41","author":"R Karuppiah","year":"2008","unstructured":"Karuppiah, R., Grossmann, I.E.: A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures. J. Glob. Optim. 41(2), 163\u2013186 (2008)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"769_CR15","doi-asserted-by":"publisher","first-page":"051,009","DOI":"10.1115\/1.3087559","volume":"131","author":"A Khajavirad","year":"2009","unstructured":"Khajavirad, A., Michalek, J.J.: A deterministic lagrangian-based global optimization approach for quasiseparable nonconvex mixed-integer nonlinear programs. J. Mech. Des. 131(5), 051,009 (2009)","journal-title":"J. Mech. Des."},{"issue":"3","key":"769_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10957-011-9888-1","volume":"151","author":"X Li","year":"2011","unstructured":"Li, X., Tomasgard, A., Barton, P.I.: Nonconvex generalized benders decomposition for stochastic separable mixed-integer nonlinear programs. J. Optim. Theory Appl. 151(3), 425 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"769_CR17","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., et al.: The scip optimization suite 4.0 (2017)"},{"issue":"2\u20133","key":"769_CR18","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. Glob. Optim. 59(2\u20133), 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"769_CR19","volume-title":"A Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer, New York (2013)"},{"issue":"4\u20135","key":"769_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"EM Smith","year":"1999","unstructured":"Smith, E.M., 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)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"769_CR21","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."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00769-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00769-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00769-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T09:33:08Z","timestamp":1589880788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00769-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,16]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["769"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00769-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,16]]},"assertion":[{"value":"13 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}