{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T21:06:51Z","timestamp":1769548011599,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T00:00:00Z","timestamp":1509148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T00:00:00Z","timestamp":1509148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1562245"],"award-info":[{"award-number":["CMMI-1562245"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10479-017-2689-7","type":"journal-article","created":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T08:26:22Z","timestamp":1509179182000},"page":"583-604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Partition-based decomposition algorithms for two-stage Stochastic integer programs with continuous recourse"],"prefix":"10.1007","volume":"284","author":[{"given":"Babak Saleck","family":"Pay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6839-522X","authenticated-orcid":false,"given":"Yongjia","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,28]]},"reference":[{"key":"2689_CR1","unstructured":"Ahmed, S., Garcia, R., Kong, N., Ntaimo, L., Parija, G. R., Qiu, F. (2015). A stochastic integer programming test problem library, \nhttp:\/\/www.isye.gatech.edu\/~sahmed\/siplib\n\n."},{"issue":"3","key":"2689_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1111\/j.1475-3995.2004.00456.x","volume":"11","author":"VM Albornoz","year":"2004","unstructured":"Albornoz, V. M., Benario, P., & Rojas, M. E. (2004). A two-stage stochastic integer programming model for a thermal power system expansion. International Transactions in Operational Research, 11(3), 243\u2013257.","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"2689_CR3","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"2689_CR4","doi-asserted-by":"crossref","unstructured":"Bienstock, Daniel, & Zuckerberg, Mark (2010). Solving LP relaxations of large-scale precedence constrained problems. IPCO 1\u201314.","DOI":"10.1007\/978-3-642-13036-6_1"},{"key":"2689_CR5","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. (2011). Introduction to stochastic programming. Berlin: Springer Science & Business Media."},{"issue":"1","key":"2689_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/ijoc.2016.0717","volume":"29","author":"M Bodur","year":"2016","unstructured":"Bodur, M., Dash, S., G\u00fcnl\u00fck, O., & Luedtke, J. (2016). Strengthened benders cuts for stochastic integer programs with continuous recourse. INFORMS Journal on Computing, 29(1), 77\u201391.","journal-title":"INFORMS Journal on Computing"},{"key":"2689_CR7","unstructured":"Bodur, Merve, Luedtke, James R (2016). Mixed-integer rounding enhanced benders decomposition for multiclass service-system staffing and scheduling with arrival rate uncertainty. Management Science."},{"key":"2689_CR8","volume-title":"Numerical optimization: theoretical and practical aspects.","author":"J-F Bonnans","year":"2006","unstructured":"Bonnans, J.-F., Gilbert, J. C., Lemar\u00e9chal, C., & Sagastiz\u00e1bal, C. (2006). Numerical optimization: theoretical and practical aspects. Berlin: Springer."},{"issue":"6","key":"2689_CR9","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1287\/opre.1110.0965","volume":"59","author":"I Contreras","year":"2011","unstructured":"Contreras, I., Cordeau, J.-F., & Laporte, G. (2011). Benders decomposition for large-scale uncapacitated hub location. Operations Research, 59(6), 1477\u20131490.","journal-title":"Operations Research"},{"issue":"6","key":"2689_CR10","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1080\/10556788.2013.871282","volume":"29","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira, W., & Sagastiz\u00e1bal, C. (2014). Level bundle methods for oracles with on-demand accuracy. Optimization Methods and Software, 29(6), 1180\u20131209.","journal-title":"Optimization Methods and Software"},{"issue":"2","key":"2689_CR11","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/100808289","volume":"21","author":"W de Oliveira","year":"2011","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C., & Scheimberg, S. (2011). Inexact bundle methods for two-stage stochastic programming. SIAM Journal on Optimization, 21(2), 517\u2013544.","journal-title":"SIAM Journal on Optimization"},{"key":"2689_CR12","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. (2014). A primal-dual aggregation algorithm for minimizing conditional-value-at-risk in linear programs. Computational Optimization and Applications, 59, 617\u2013638.","journal-title":"Computational Optimization and Applications"},{"issue":"1\u20134","key":"2689_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1019245101545","volume":"99","author":"E Fragniere","year":"2000","unstructured":"Fragniere, E., Gondzio, J., & Vial, J.-P. (2000). Building and solving large-scale stochastic programs on an affordable distributed computing system. Annals of Operations Research, 99(1\u20134), 167\u2013187.","journal-title":"Annals of Operations Research"},{"key":"2689_CR14","doi-asserted-by":"crossref","unstructured":"Higle, J. L., & Sen, S. (1991). Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Mathematics of Operations Research, 16(3), 650\u2013669.","DOI":"10.1287\/moor.16.3.650"},{"key":"2689_CR15","volume-title":"Convex analysis and minimization algorithms I: Fundamentals","author":"J-B Hiriart-Urruty","year":"2013","unstructured":"Hiriart-Urruty, J.-B., & Lemar\u00e9chal, C. (2013). Convex analysis and minimization algorithms I: Fundamentals. Berlin: Springer science & business media."},{"issue":"6","key":"2689_CR16","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1287\/opre.2015.1421","volume":"63","author":"K Kim","year":"2015","unstructured":"Kim, K., & Mehrotra, S. (2015). A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management. Operations Research, 63(6), 1431\u20131451.","journal-title":"Operations Research"},{"issue":"1","key":"2689_CR17","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10479-008-0476-1","volume":"166","author":"ML Jes\u00fas","year":"2009","unstructured":"Jes\u00fas, M. L., Cerisola, S., Ramos, A., & Palacios, R. (2009). Analysis of stochastic problem decomposition algorithms in computational grids. Annals of Operations Research, 166(1), 355\u2013373.","journal-title":"Annals of Operations Research"},{"issue":"1\u20133","key":"2689_CR18","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. (1995). New variants of bundle methods. Mathematical Programming, 69(1\u20133), 111\u2013147.","journal-title":"Mathematical Programming"},{"key":"2689_CR19","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. (2006). The empirical behavior of sampling methods for stochastic programming. Annals of Operations Research, 142, 215\u2013241.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2689_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02027380","volume":"6","author":"FV Louveaux","year":"1986","unstructured":"Louveaux, F. V. (1986). Discrete stochastic location models. Annals of Operations Research, 6(2), 21\u201334.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2689_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF01580883","volume":"35","author":"A Ruszczy\u0144ski","year":"1986","unstructured":"Ruszczy\u0144ski, A. (1986). A regularized decomposition method for minimizing a sum of polyhedral functions. Mathematical Programming, 35(3), 309\u2013333.","journal-title":"Mathematical Programming"},{"issue":"2","key":"2689_CR22","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/S0377-2217(96)00401-8","volume":"101","author":"A Ruszczy\u0144ski","year":"1997","unstructured":"Ruszczy\u0144ski, A., & \u015awietanowski, A. (1997). Accelerating the regularized decomposition method for two stage stochastic linear problems. European Journal of Operational Research, 101(2), 328\u2013342.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2689_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1111\/j.1475-3995.2009.00706.x","volume":"17","author":"GKD Saharidis","year":"2010","unstructured":"Saharidis, G. K. D., Minoux, M., & Ierapetritou, M. G. (2010). Accelerating benders method using covering cut bundle generation. International Transactions in Operational Research, 17(2), 221\u2013237.","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"2689_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6377(93)90003-Y","volume":"13","author":"S Sen","year":"1993","unstructured":"Sen, S. (1993). Subgradient decomposition and differentiability of the recourse function of a two stage stochastic linear program. Operations Research Letters, 13(3), 143\u2013148.","journal-title":"Operations Research Letters"},{"key":"2689_CR25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic programming: Modeling and theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., & Ruszczy\u0144ski, A. (2009). Lectures on Stochastic programming: Modeling and theory. Philadelphia: SIAM."},{"issue":"3","key":"2689_CR26","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1137\/140967337","volume":"25","author":"Y Song","year":"2015","unstructured":"Song, Y., & Luedtke, J. (2015). An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse. SIAM Journal on Optimization, 25(3), 1344\u20131367.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"2689_CR27","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2010.02.025","volume":"206","author":"S Trukhanov","year":"2010","unstructured":"Trukhanov, S., Ntaimo, L., & Schaefer, A. (2010). Adaptive multicut aggregation for two-stage stochastic linear programs with recourse. European Journal of Operational Research, 206(2), 395\u2013406.","journal-title":"European Journal of Operational Research"},{"key":"2689_CR28","unstructured":"van Ackooij, Wim, de Oliveira, Welington, Song, Yongjia (2016). An adaptive partition-based level decomposition for solving two-stage stochastic programs with fixed recourse. Submitted for publication."},{"issue":"2","key":"2689_CR29","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCSE.2011.37","volume":"13","author":"S Van Der Walt","year":"2011","unstructured":"Van Der Walt, S., Colbert, S. C., & Varoquaux, G. (2011). The numpy array: A structure for efficient numerical computation. Computing in Science and Engineering, 13(2), 22\u201330.","journal-title":"Computing in Science and Engineering"},{"issue":"4","key":"2689_CR30","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. (1969). L-shaped linear programs with applications to optimal control and stochastic programming. SIAM Journal on Applied Mathematics, 17(4), 638\u2013663.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"2","key":"2689_CR31","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. (2014). Applying oracles of on-demand accuracy in two-stage stochastic programming - A computational study. European Journal of Operational Research, 239(2), 437\u2013448.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2689_CR32","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ejor.2013.04.017","volume":"230","author":"C Wolf","year":"2013","unstructured":"Wolf, C., & Koberstein, A. (2013). Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method. European Journal of Operational Research, 230(1), 143\u2013156.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2689_CR33","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10479-011-0974-4","volume":"210","author":"F You","year":"2013","unstructured":"You, F., & Grossmann, I. E. (2013). Multicut benders decomposition algorithm for process supply chain planning under uncertainty. Annals of Operations Research, 210(1), 191\u2013211.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2689_CR34","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1057\/palgrave.jors.2602522","volume":"60","author":"X Zhu","year":"2009","unstructured":"Zhu, X., & Sherali, H. D. (2009). Two-stage workforce planning under demand fluctuations and uncertainty. Journal of the Operational Research Society, 60(1), 94\u2013103.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"2689_CR35","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. D., & Mitra, G. (2012). A computational study of a solver system for processing two-stage stochastic LPs with enhanced benders decomposition. Mathematical Programming Computation, 4(3), 211\u2013238.","journal-title":"Mathematical Programming Computation"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2689-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2689-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2689-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T15:51:19Z","timestamp":1589730679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2689-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,28]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["2689"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2689-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,28]]},"assertion":[{"value":"28 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}