{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T15:42:11Z","timestamp":1763480531914,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11590-021-01839-5","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:04:11Z","timestamp":1642637051000},"page":"2607-2644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0672-8161","authenticated-orcid":false,"given":"Carlos Andr\u00e9s","family":"Gamboa","sequence":"first","affiliation":[]},{"given":"Davi Michel","family":"Vallad\u00e3o","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Street","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"1839_CR1","volume-title":"Mathematical Analysis. Addison-Wesley series in mathematics","author":"T Apostol","year":"1974","unstructured":"Apostol, T.: Mathematical Analysis. Addison-Wesley series in mathematics. Addison-Wesley, Boston (1974)"},{"issue":"2","key":"1839_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/5992.753049","volume":"1","author":"I Beichl","year":"1999","unstructured":"Beichl, I., Sullivan, F.: The importance of importance sampling. Comput. Sci. Eng. 1(2), 71\u201373 (1999)","journal-title":"Comput. Sci. Eng."},{"issue":"1\u20132","key":"1839_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10107-017-1174-z","volume":"171","author":"D Bertsimas","year":"2018","unstructured":"Bertsimas, D., Gupta, V., Kallus, N.: Robust sample average approximation. Math. Program. 171(1\u20132), 217\u2013282 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"1839_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"1839_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"J Birge","year":"2011","unstructured":"Birge, J., Louveaux: Introduction to Stochastic Programming, 2nd edn. Springer, New York Dordrecht Heidelberg London (2011)","edition":"2"},{"key":"1839_CR6","first-page":"54","volume":"84","author":"JR Birge","year":"1986","unstructured":"Birge, J.R., West, R.J.: Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse. Stoch. Program. 84, 54\u2013102 (1986)","journal-title":"Stoch. Program."},{"key":"1839_CR7","volume-title":"Linear Programming and Extensions","author":"GB Dantzig","year":"1991","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1991)"},{"issue":"2","key":"1839_CR8","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":"1","key":"1839_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02187644","volume":"64","author":"NCP Edirisinghe","year":"1996","unstructured":"Edirisinghe, N.C.P., You, G.-M.: Second-order scenario approximation and refinement in optimization under uncertainty. Ann. Oper. Res. 64(1), 143\u2013178 (1996)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"1839_CR10","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1287\/moor.19.2.292","volume":"19","author":"NCP Edirisinghe","year":"1994","unstructured":"Edirisinghe, N.C.P., Ziemba, W.T.: Bounds for two-stage stochastic programs with fixed recourse. Math. Oper. Res. 19(2), 292\u2013313 (1994)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1839_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02592157","volume":"75","author":"NCP Edirisinghe","year":"1996","unstructured":"Edirisinghe, N.C.P., Ziemba, W.T.: Implementing bounds-based approximations in convex\u2013concave two-stage stochastic programming. Math. Program. 75(2), 295\u2013325 (1996)","journal-title":"Math. Program."},{"issue":"3","key":"1839_CR12","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1287\/moor.13.3.377","volume":"13","author":"K Frauendorfer","year":"1988","unstructured":"Frauendorfer, K.: Solving slp recourse problems with arbitrary multivariate distributions: the dependent case. Math. Oper. Res. 13(3), 377\u2013394 (1988)","journal-title":"Math. Oper. Res."},{"key":"1839_CR13","first-page":"177","volume":"17","author":"K Frauendorfer","year":"1988","unstructured":"Frauendorfer, K., Kall, P.: A solution method for slp recourse problems with arbitrary multivariate distributions: the independent case. Prob. Control Inform. Theory 17, 177\u2013205 (1988)","journal-title":"Prob. Control Inform. Theory"},{"key":"1839_CR14","first-page":"39","volume-title":"A tight upper bound for the expectation of a convex function of a multivariate random variable","author":"H Gassmann","year":"1986","unstructured":"Gassmann, H., Ziemba, W.T.: A tight upper bound for the expectation of a convex function of a multivariate random variable, pp. 39\u201353. Springer Berlin Heidelberg, Berlin, Heidelberg (1986)"},{"issue":"2","key":"1839_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1287\/opre.25.2.315","volume":"25","author":"CC Huang","year":"1977","unstructured":"Huang, C.C., Ziemba, W.T., Ben-Tal, A.: Bounds on the expectation of a convex function of a random variable: with applications to stochastic programming. Oper. Res. 25(2), 315\u2013325 (1977)","journal-title":"Oper. Res."},{"key":"1839_CR16","first-page":"33","volume-title":"Approximation techniques in stochastic programming","author":"P Kall","year":"1988","unstructured":"Kall, P., Ruszczy\u0144ski, A., Frauendorfer, K.: Approximation techniques in stochastic programming, pp. 33\u201364. Springer, Berlin (1988)"},{"issue":"3","key":"1839_CR17","first-page":"431","volume":"13","author":"P Kall","year":"1982","unstructured":"Kall, P., Stoyan, D.: Solving stochastic programming problems with recourse including error bounds. Math. Oper. schung und Statistik Ser. Optim. 13(3), 431\u2013447 (1982)","journal-title":"Math. Oper. schung und Statistik Ser. Optim."},{"issue":"3","key":"1839_CR18","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1214\/aoms\/1177706203","volume":"30","author":"A Madansky","year":"1959","unstructured":"Madansky, A.: Bounds on the expectation of a convex function of a multivariate random variable. Ann. Math. Statist. 30(3), 743\u2013746 (1959)","journal-title":"Ann. Math. Statist."},{"issue":"1","key":"1839_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","volume":"171","author":"P Mohajerin Esfahani","year":"2018","unstructured":"Mohajerin Esfahani, P., Kuhn, D.: Data-driven distributionally robust optimization using the wasserstein metric: performance guarantees and tractable reformulations. Math. Program. 171(1), 115\u2013166 (2018)","journal-title":"Math. Program."},{"key":"1839_CR20","doi-asserted-by":"crossref","unstructured":"O\u2019Leary, D.: Multidimensional integration: partition and conquer. Comput. Sci. Eng. 6(6), 58\u201366 (2004)","DOI":"10.1109\/MCSE.2004.71"},{"issue":"3","key":"1839_CR21","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1287\/opre.2013.1174","volume":"61","author":"A Papavasiliou","year":"2013","unstructured":"Papavasiliou, A., Oren, S.S.: Multiarea stochastic unit commitment for high wind penetration in a transmission constrained network. Oper. Res. 61(3), 578\u2013592 (2013)","journal-title":"Oper. Res."},{"key":"1839_CR22","volume-title":"Quadpack: a subroutine package for automatic integration","author":"R Piessens","year":"2012","unstructured":"Piessens, R., de Doncker-Kapenga, E., \u00dcberhuber, C.W., Kahaner, D.K.: Quadpack: a subroutine package for automatic integration, vol. 1. Springer, Berlin (2012)"},{"issue":"3","key":"1839_CR23","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1109\/TPWRS.2010.2087367","volume":"26","author":"A Street","year":"2011","unstructured":"Street, A., Oliveira, F., Arroyo, J.M.: Contingency-constrained unit commitment with $$n - k$$ security criterion: a robust optimization approach. IEEE Trans. Power Syst. 26(3), 1581\u20131590 (2011)","journal-title":"IEEE Trans. Power Syst."},{"issue":"5","key":"1839_CR24","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng, B., Zhao, L.: Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5), 457\u2013461 (2013)","journal-title":"Oper. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01839-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01839-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01839-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T13:03:28Z","timestamp":1666875808000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01839-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,20]]},"references-count":24,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1839"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01839-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,1,20]]},"assertion":[{"value":"14 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}