{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T06:53:58Z","timestamp":1776149638260,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:00:00Z","timestamp":1614038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:00:00Z","timestamp":1614038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002848","name":"Comisi\u00f3n Nacional de Investigaci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","award":["FONDECYT 1161064 & 1200809"],"award-info":[{"award-number":["FONDECYT 1161064 & 1200809"]}],"id":[{"id":"10.13039\/501100002848","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10107-020-01609-8","type":"journal-article","created":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T14:24:32Z","timestamp":1614090272000},"page":"755-774","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse"],"prefix":"10.1007","volume":"196","author":[{"given":"Cristian","family":"Ramirez-Pico","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3404-8294","authenticated-orcid":false,"given":"Eduardo","family":"Moreno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,23]]},"reference":[{"issue":"3","key":"1609_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/ijoc.2016.0695","volume":"28","author":"G Angulo","year":"2016","unstructured":"Angulo, G., Ahmed, S., Dey, S.S.: Improving the integer L-shaped method. INFORMS J. Comput. 28(3), 483\u2013499 (2016). https:\/\/doi.org\/10.1287\/ijoc.2016.0695","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1609_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/1467-9965.00068","volume":"9","author":"P Artzner","year":"1999","unstructured":"Artzner, P., Delbaen, F., Eber, J.M., Heath, D.: Coherent measures of risk. Math. Finance 9(3), 203\u2013228 (1999)","journal-title":"Math. Finance"},{"issue":"4","key":"1609_CR3","first-page":"277","volume":"7","author":"S Barik","year":"2013","unstructured":"Barik, S., Biswal, M.P., Chakravarty, D.: Two-stage stochastic programming problems involving some continuous random variables. J. Uncertain Syst. 7(4), 277\u2013288 (2013)","journal-title":"J. Uncertain Syst."},{"key":"1609_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.2307\/2582903","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069\u20131072 (1990). https:\/\/doi.org\/10.2307\/2582903","journal-title":"J. Oper. Res. Soc."},{"key":"1609_CR5","doi-asserted-by":"publisher","unstructured":"Bienstock, D., Zuckerberg, M.: Solving LP relaxations of large-scale precedence constrained problems. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 1\u201314. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13036-6_1","DOI":"10.1007\/978-3-642-13036-6_1"},{"key":"1609_CR6","doi-asserted-by":"publisher","unstructured":"Birge, J.R., Wets, R.J.B.: Designing approximation schemes for stochastic optimization problems. In: Particular for Stochastic Programs with Recourse, pp. 54\u2013102. Springer, Berlin (1986). https:\/\/doi.org\/10.1007\/BFb0121114","DOI":"10.1007\/BFb0121114"},{"issue":"1","key":"1609_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1111\/rssb.12162","volume":"79","author":"ZI Botev","year":"2017","unstructured":"Botev, Z.I.: The normal law under linear restrictions: simulation and estimation via minimax tilting. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 79(1), 125\u2013148 (2017). https:\/\/doi.org\/10.1111\/rssb.12162","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"1609_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2942-8","author":"TG Crainic","year":"2018","unstructured":"Crainic, T.G., Maggioni, F., Perboli, G., Rei, W.: Reduced cost-based variable fixing in two-stage stochastic programming. Ann. Oper. Res. (2018). https:\/\/doi.org\/10.1007\/s10479-018-2942-8","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"1609_CR9","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1287\/opre.40.4.660","volume":"40","author":"NCP Edirisinghe","year":"1992","unstructured":"Edirisinghe, N.C.P., Ziemba, W.T.: Tight bounds for stochastic convex programs. Oper. Res. 40(4), 660\u2013677 (1992). https:\/\/doi.org\/10.1287\/opre.40.4.660","journal-title":"Oper. Res."},{"key":"1609_CR10","unstructured":"Edmundson, H.: Bounds on the expectation of a convex function of a random variable. Tech. rep., The RAND Corporation (1956)"},{"issue":"3","key":"1609_CR11","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10589-014-9692-6","volume":"59","author":"D Espinoza","year":"2014","unstructured":"Espinoza, D., Moreno, E.: A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs. Comput. Optim. Appl. 59(3), 617\u2013638 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9692-6","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1609_CR12","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1287\/moor.16.3.650","volume":"16","author":"JL Higle","year":"1991","unstructured":"Higle, J.L., Sen, S.: Stochastic decomposition: an algorithm for two-stage linear programs with recourse. Math. Oper. Res. 16(3), 650\u2013669 (1991). https:\/\/doi.org\/10.1287\/moor.16.3.650","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1609_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.sorms.2014.05.001","volume":"19","author":"T Homem-de-Mello","year":"2014","unstructured":"Homem-de-Mello, T., Bayraksan, G.: Monte Carlo sampling-based methods for stochastic optimization. Surv. Oper. Res. Manag. Sci. 19(1), 56\u201385 (2014). https:\/\/doi.org\/10.1016\/j.sorms.2014.05.001","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"1609_CR14","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7729-8","volume-title":"Stochastic Linear Programming","author":"P Kall","year":"2011","unstructured":"Kall, P., Mayer, J.: Stochastic Linear Programming. International Series in Operations Research & Management Science, vol. 156, 2nd edn. Springer, Berlin (2011)","edition":"2"},{"issue":"2","key":"1609_CR15","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt, A.J., Shapiro, A., Homem-de-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479\u2013502 (2002). https:\/\/doi.org\/10.1137\/S1052623499363220","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1609_CR16","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/j.ejor.2014.09.024","volume":"241","author":"G Lagos","year":"2015","unstructured":"Lagos, G., Espinoza, D., Moreno, E., Vielma, J.P.: Restricted risk measures and robust optimization. Eur. J. Oper. Res. 241(3), 771\u2013782 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.09.024","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"1609_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69(1\u20133), 111\u2013147 (1995). https:\/\/doi.org\/10.1007\/BF01585555","journal-title":"Math. Program."},{"issue":"1","key":"1609_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10479-006-6169-8","volume":"142","author":"J Linderoth","year":"2006","unstructured":"Linderoth, J., Shapiro, A., Wright, S.: The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142(1), 215\u2013241 (2006). https:\/\/doi.org\/10.1007\/s10479-006-6169-8","journal-title":"Ann. Oper. Res."},{"key":"1609_CR19","volume-title":"Numerical Techniques for Stochastic Optimization Problems","author":"FV Louveaux","year":"1988","unstructured":"Louveaux, F.V., Smeers, Y.: Optimal investments for electricity generation: a stochastic model and a test problem. In: Ermoliev, Y., Wets, R.J.B. (eds.) Numerical Techniques for Stochastic Optimization Problems. Springer, Berlin (1988)"},{"key":"1609_CR20","doi-asserted-by":"crossref","unstructured":"Madansky, A.: Bounds on the expectation of a convex function of a multivariate random variable. Ann. Math. Stat. 30(3), 743\u2013746 (1959). https:\/\/doi.org\/10.1214\/aoms\/1177706203","DOI":"10.1214\/aoms\/1177706203"},{"issue":"2","key":"1609_CR21","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10589-017-9946-1","volume":"69","author":"G Mu\u00f1oz","year":"2018","unstructured":"Mu\u00f1oz, G., Espinoza, D., Goycoolea, M., Moreno, E., Queyranne, M., Letelier, O.R.: A study of the Bienstock\u2013Zuckerberg algorithm: applications in mining and resource constrained project scheduling. Comput. Optim. Appl. 69(2), 501\u2013534 (2018). https:\/\/doi.org\/10.1007\/s10589-017-9946-1","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1609_CR22","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/100808289","volume":"21","author":"W Oliveira","year":"2011","unstructured":"Oliveira, W., Sagastiz\u00e1bal, C., Scheimberg, S.: Inexact bundle methods for two-stage stochastic programming. SIAM J. Optim. 21(2), 517\u2013544 (2011). https:\/\/doi.org\/10.1137\/100808289","journal-title":"SIAM J. Optim."},{"key":"1609_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2689-7","author":"BS Pay","year":"2017","unstructured":"Pay, B.S., Song, Y.: Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse. Ann. Oper. Res. (2017). https:\/\/doi.org\/10.1007\/s10479-017-2689-7","journal-title":"Ann. Oper. Res."},{"issue":"1\u20133","key":"1609_CR24","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01582895","volume":"52","author":"MV Pereira","year":"1991","unstructured":"Pereira, M.V., Pinto, L.M.: Multi-stage stochastic optimization applied to energy planning. Math. Program. 52(1\u20133), 359\u2013375 (1991). https:\/\/doi.org\/10.1007\/BF01582895","journal-title":"Math. Program."},{"key":"1609_CR25","unstructured":"Rahmaniani, R., Crainic, T., Gendreau, M., Rei, W.: A benders decomposition method for two-stage stochastic network design problems. Tech. Rep. CIRRELT-2017-22, Centre interuniversitaire de recherche sur les r\u00e9seaux d\u2019entreprise, la logistique et le transport (2017)"},{"issue":"1","key":"1609_CR26","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/17M1128204","volume":"28","author":"R Rahmaniani","year":"2018","unstructured":"Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: Accelerating the benders decomposition method: application to stochastic network design problems. SIAM J. Optim. 28(1), 875\u2013903 (2018). https:\/\/doi.org\/10.1137\/17M1128204","journal-title":"SIAM J. Optim."},{"key":"1609_CR27","unstructured":"Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: An asynchronous parallel benders decomposition method. Tech. Rep. CIRRELT-2019-49, Centre interuniversitaire de recherche sur les r\u00e9seaux d\u2019entreprise, la logistique et le transport (2019)"},{"key":"1609_CR28","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R.T., Uryasev, S., et al.: Optimization of conditional value-at-risk. J. Risk 2, 21\u201342 (2000). https:\/\/doi.org\/10.21314\/JOR.2000.038","journal-title":"J. Risk"},{"issue":"1","key":"1609_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16(1), 119\u2013147 (1991). https:\/\/doi.org\/10.1287\/moor.16.1.119","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1609_CR30","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF01580883","volume":"35","author":"A Ruszczy\u0144ski","year":"1986","unstructured":"Ruszczy\u0144ski, A.: A regularized decomposition method for minimizing a sum of polyhedral functions. Math. Program. 35(3), 309\u2013333 (1986). https:\/\/doi.org\/10.1007\/BF01580883","journal-title":"Math. Program."},{"key":"1609_CR31","doi-asserted-by":"publisher","unstructured":"Ryan, K., Rajan, D., Ahmed, S.: Scenario decomposition for 0-1 stochastic programs: improvements and asynchronous implementation. In: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, pp. 722\u2013729. IEEE (2016). https:\/\/doi.org\/10.1109\/IPDPSW.2016.119","DOI":"10.1109\/IPDPSW.2016.119"},{"key":"1609_CR32","series-title":"MOS-SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973433","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2014","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory. MOS-SIAM Series on Optimization. SIAM, Philadelphia (2014)"},{"key":"1609_CR33","unstructured":"Siddig, M., Song, Y.: Adaptive partition-based SDDP algorithms for multistage stochastic linear programming. Tech. rep. (2019). arXiv:1908.11346"},{"issue":"3","key":"1609_CR34","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1137\/140967337","volume":"25","author":"Y Song","year":"2015","unstructured":"Song, Y., Luedtke, J.: An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse. SIAM J. Optim. 25(3), 1344\u20131367 (2015). https:\/\/doi.org\/10.1137\/140967337","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1609_CR35","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.2017.0765","volume":"30","author":"W van Ackooij","year":"2017","unstructured":"van Ackooij, W., de Oliveira, W., Song, Y.: Adaptive partition-based level decomposition methods for solving two-stage stochastic programs with fixed recourse. INFORMS J. Comput. 30(1), 57\u201370 (2017). https:\/\/doi.org\/10.1287\/ijoc.2017.0765","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1609_CR36","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Van Slyke","year":"1969","unstructured":"Van Slyke, R.M., Wets, R.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4), 638\u2013663 (1969). https:\/\/doi.org\/10.1137\/0117061","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"1609_CR37","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"JP Vielma","year":"2008","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs. INFORMS J. Comput. 20(3), 438\u2013450 (2008). https:\/\/doi.org\/10.1287\/ijoc.1070.0256","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1609_CR38","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10287-010-0125-4","volume":"8","author":"JP Watson","year":"2011","unstructured":"Watson, J.P., Woodruff, D.L.: Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems. CMS 8(4), 355\u2013370 (2011). https:\/\/doi.org\/10.1007\/s10287-010-0125-4","journal-title":"CMS"},{"issue":"2","key":"1609_CR39","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ejor.2014.05.010","volume":"239","author":"C Wolf","year":"2014","unstructured":"Wolf, C., F\u00e1bi\u00e1n, C.I., Koberstein, A., Suhl, L.: Applying oracles of on-demand accuracy in two-stage stochastic programming\u2014a computational study. Eur. J. Oper. Res. 239(2), 437\u2013448 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2014.05.010","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1609_CR40","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s12532-012-0038-z","volume":"4","author":"V Zverovich","year":"2012","unstructured":"Zverovich, V., F\u00e1bi\u00e1n, C.I., Ellison, E.F., Mitra, G.: A computational study of a solver system for processing two-stage stochastic LPs with enhanced benders decomposition. Math. Program. Comput. 4(3), 211\u2013238 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0038-z","journal-title":"Math. Program. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01609-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01609-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01609-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T00:32:50Z","timestamp":1667867570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01609-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,23]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1609"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01609-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,23]]},"assertion":[{"value":"3 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}