{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T01:17:58Z","timestamp":1772155078280,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T00:00:00Z","timestamp":1742342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T00:00:00Z","timestamp":1742342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["20207C8T9M"],"award-info":[{"award-number":["20207C8T9M"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015968","name":"Universit\u00e0 degli studi di Bergamo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100015968","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper, we consider multi-stage robust optimization problems of the minimax type. We assume that the total uncertainty set is the cartesian product of stagewise compact uncertainty sets and approximate the given problem by a sampled subproblem. Instead of looking for the worst case among the infinite and typically uncountable set of uncertain parameters, we consider only the worst case among a randomly selected subset of parameters. By adopting such a strategy, two main questions arise: (1) Can we quantify the error committed by the random approximation, especially as a function of the sample size? (2) If the sample size tends to infinity, does the optimal value converge to the \u201ctrue\u201d optimal value? Both questions will be answered in this paper. An explicit bound on the probability of violation is given and chain of lower bounds on the original multi-stage robust optimization problem provided. Numerical results dealing with a multi-stage inventory management problem show that the proposed approach works well for problems with two or three time periods while for larger ones the number of required samples is prohibitively large for computational tractability. Despite this, we believe that our results can be useful for problems with such small number of time periods, and it sheds some light on the challenge for problems with more time periods.<\/jats:p>","DOI":"10.1007\/s10479-025-06545-4","type":"journal-article","created":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:17:54Z","timestamp":1742383074000},"page":"1385-1423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Sampling methods for multi-stage robust optimization problems"],"prefix":"10.1007","volume":"347","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3968-1934","authenticated-orcid":false,"given":"Francesca","family":"Maggioni","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Dabbene","sequence":"additional","affiliation":[]},{"given":"Georg Ch.","family":"Pflug","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,19]]},"reference":[{"key":"6545_CR1","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.automatica.2014.11.004","volume":"52","author":"T Alamo","year":"2015","unstructured":"Alamo, T., Tempo, R., Luque, A., & Ramirez, D. R. (2015). Randomized methods for design of uncertain systems: Sample complexity and sequential algorithms. Automatica, 52, 160\u2013172. https:\/\/doi.org\/10.1016\/j.automatica.2014.11.004","journal-title":"Automatica"},{"issue":"3","key":"6545_CR2","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D. B., & Caramanis, C. (2011). Theory and applications of robust optimization. SIAM Review, 53(3), 464\u2013501. https:\/\/doi.org\/10.1137\/080734510","journal-title":"SIAM Review"},{"issue":"4","key":"6545_CR3","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1287\/opre.2016.1515","volume":"64","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., & Dunning, I. (2016). Multistage robust mixed-integer optimization with adaptive partitions. Operations Research, 64(4), 980\u2013998. https:\/\/doi.org\/10.1287\/opre.2016.1515","journal-title":"Operations Research"},{"issue":"2","key":"6545_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10107-017-1135-6","volume":"167","author":"D Bertsimas","year":"2018","unstructured":"Bertsimas, D., & Georghiou, A. (2018). Binary decision rules for multistage adaptive mixed-integer optimization. Mathematical Programming, 167(2), 395\u2013433.","journal-title":"Mathematical Programming"},{"issue":"12","key":"6545_CR5","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TAC.2011.2162878","volume":"56","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Iancu, D. A., & Parrilo, P. A. (2011). A hierarchy of near-optimal policies for multistage adaptive optimization. IEEE Transactions on Automatic Control, 56(12), 2809\u20132824. https:\/\/doi.org\/10.1109\/TAC.2011.2162878","journal-title":"IEEE Transactions on Automatic Control"},{"key":"6545_CR6","doi-asserted-by":"crossref","unstructured":"Bampou, D., & Kuhn, D. (2011). Scenario-free stochastic programming with polynomial decision rules. In 2011 50th IEEE Conference on Decision and Control and European Control Conference, pp. 7806\u20137812. IEEE.","DOI":"10.1109\/CDC.2011.6161150"},{"key":"6545_CR7","first-page":"1","volume":"19","author":"M Bodur","year":"2018","unstructured":"Bodur, M., & Luedtke, J. R. (2018). Two-stage linear decision rules for multi-stage stochastic programming. Mathematical Programming, 19, 1\u201334.","journal-title":"Mathematical Programming"},{"issue":"5","key":"6545_CR8","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1111\/j.1937-5956.2010.01194.x","volume":"20","author":"O Baron","year":"2011","unstructured":"Baron, O., Milner, J., & Naseraldin, H. (2011). Facility location: A robust optimization approach. Production and Operations Management, 20(5), 772\u2013785. https:\/\/doi.org\/10.1111\/j.1937-5956.2010.01194.x","journal-title":"Production and Operations Management"},{"issue":"1","key":"6545_CR9","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/opre.1050.0238","volume":"54","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas, D., & Thiele, A. (2006). A robust optimization approach to inventory theory. Operations Research, 54(1), 150\u2013168. https:\/\/doi.org\/10.1287\/opre.1050.0238","journal-title":"Operations Research"},{"issue":"2","key":"6545_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2003","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., & Nemirovski, A. (2003). Adjustable robust solutions of uncertain linear programs. Mathematical Programming, 99(2), 351\u2013376. https:\/\/doi.org\/10.1007\/s10107-003-0454-y","journal-title":"Mathematical Programming"},{"issue":"3","key":"6545_CR11","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/msom.1050.0081","volume":"7","author":"A Ben-Tal","year":"2005","unstructured":"Ben-Tal, A., Golany, B., Nemirovski, A., & Vial, J.-P. (2005). Retailer-supplier flexible commitments contracts: A robust optimization approach. Manufacturing & Service Operations Management, 7(3), 248\u2013271. https:\/\/doi.org\/10.1287\/msom.1050.0081","journal-title":"Manufacturing & Service Operations Management"},{"issue":"1","key":"6545_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., & Nemirovski, A. (1999). Robust solutions of uncertain linear programs. Operations Research Letters, 25(1), 1\u201313. https:\/\/doi.org\/10.1016\/S0167-6377(99)00016-4","journal-title":"Operations Research Letters"},{"issue":"2","key":"6545_CR13","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/S1052623401392354","volume":"13","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A., & Roos, C. (2002). Robust solutions of uncertain quadratic and conic-quadratic problems. SIAM Journal on Optimization, 13(2), 535\u2013560. https:\/\/doi.org\/10.1137\/S1052623401392354","journal-title":"SIAM Journal on Optimization"},{"issue":"6","key":"6545_CR14","doi-asserted-by":"publisher","first-page":"3427","DOI":"10.1137\/090773490","volume":"20","author":"GC Calafiore","year":"2010","unstructured":"Calafiore, G. C. (2010). Random convex programs. SIAM Journal on Optimization, 20(6), 3427\u20133464. https:\/\/doi.org\/10.1137\/090773490","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"6545_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","volume":"102","author":"G Calafiore","year":"2004","unstructured":"Calafiore, G., & Campi, M. C. (2004). Uncertain convex programs: Randomized solutions and confidence levels. Mathematical Programming, 102(1), 25\u201346. https:\/\/doi.org\/10.1007\/s10107-003-0499-y","journal-title":"Mathematical Programming"},{"issue":"7","key":"6545_CR16","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1016\/j.automatica.2011.02.029","volume":"47","author":"GC Calafiore","year":"2011","unstructured":"Calafiore, G. C., Dabbene, F., & Tempo, R. (2011). Research on probabilistic methods for control system design. Automatica, 47(7), 1279\u20131293. https:\/\/doi.org\/10.1016\/j.automatica.2011.02.029","journal-title":"Automatica"},{"issue":"3","key":"6545_CR17","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/07069821X","volume":"19","author":"MC Campi","year":"2008","unstructured":"Campi, M. C., & Garatti, S. (2008). The exact feasibility of randomized solutions of uncertain convex programs. SIAM Journal on Optimization, 19(3), 1211\u20131230. https:\/\/doi.org\/10.1137\/07069821X","journal-title":"SIAM Journal on Optimization"},{"issue":"1\u20132","key":"6545_CR18","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10107-021-01753-9","volume":"196","author":"R Chen","year":"2022","unstructured":"Chen, R., & Luedtke, J. (2022). On sample average approximation for two-stage stochastic programs without relatively complete recourse. Mathematical Programming, 196(1\u20132), 719\u2013754.","journal-title":"Mathematical Programming"},{"key":"6545_CR19","doi-asserted-by":"publisher","unstructured":"Calafiore, G., & Nilim, A. (2004). Multi-stage resource allocation under uncertainty. In Decision and Control, 2004. CDC. 43rd IEEE Conference on, vol. 1, pp. 417\u20134231. https:\/\/doi.org\/10.1109\/CDC.2004.1428665","DOI":"10.1109\/CDC.2004.1428665"},{"issue":"2","key":"6545_CR20","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/opre.1070.0457","volume":"56","author":"X Chen","year":"2008","unstructured":"Chen, X., Sim, M., Sun, P., & Zhang, J. (2008). A linear decision-based approximation approach to stochastic programming. Operations Research, 56(2), 344\u2013357.","journal-title":"Operations Research"},{"issue":"1","key":"6545_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"MS Dimitris Bertsimas","year":"2004","unstructured":"Dimitris Bertsimas, M. S. (2004). The price of robustness. Operations Research, 52(1), 35\u201353.","journal-title":"Operations Research"},{"issue":"3","key":"6545_CR22","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1287\/moor.1040.0094","volume":"29","author":"DP Farias","year":"2004","unstructured":"Farias, D. P., & Roy, B. V. (2004). On constraint sampling in the linear programming approach to approximate dynamic programming. Mathematics of Operations Research, 29(3), 462\u2013478. https:\/\/doi.org\/10.1287\/moor.1040.0094","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"6545_CR23","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10107-002-0331-0","volume":"95","author":"J Dupa\u010dov\u00e1","year":"2003","unstructured":"Dupa\u010dov\u00e1, J., Gr\u00f6we-Kuska, N., & R\u00f6misch, W. (2003). Scenario reduction in stochastic programming. Mathematical Programming, 95(3), 493\u2013511.","journal-title":"Mathematical Programming"},{"key":"6545_CR24","doi-asserted-by":"publisher","unstructured":"Delage, E., & Iancu, D.A. (2015). Robust multistage decision making. In: The Operations Research Revolution, pp. 20\u201346. Institute for Operations Research and the Management Sciences (INFORMS), Catonsville, USA. https:\/\/doi.org\/10.1287\/educ.2015.0139","DOI":"10.1287\/educ.2015.0139"},{"issue":"1","key":"6545_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-005-0678-0","volume":"107","author":"E Erdogan","year":"2006","unstructured":"Erdogan, E., & Iyengar, G. (2006). Ambiguous chance constrained problems and robust optimization. Mathematical Programming, 107(1), 37\u201361. https:\/\/doi.org\/10.1007\/s10107-005-0678-0","journal-title":"Mathematical Programming"},{"issue":"4","key":"6545_CR26","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1109\/TAC.2016.2586606","volume":"62","author":"S Formentin","year":"2016","unstructured":"Formentin, S., Dabbene, F., Tempo, R., Zaccarian, L., & Savaresi, S. M. (2016). Robust linear static anti-windup with probabilistic certificates. IEEE Transactions on Automatic Control, 62(4), 1575\u20131589.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"6545_CR27","unstructured":"Gabrel, V., Murat, C., & Thiele, A. (2012). Recent advances in robust optimization and robustness: An overview. Technical Report, LAMSADE, Universite Paris-Dauphine, Paris, France 2012."},{"issue":"1","key":"6545_CR28","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"LE Ghaoui","year":"1998","unstructured":"Ghaoui, L. E., Oustry, F., & Lebret, H. (1998). Robust solutions to uncertain semidefinite programs. SIAM Journal on Optimization, 9(1), 33\u201352. https:\/\/doi.org\/10.1137\/S1052623496305717","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"6545_CR29","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1287\/opre.2018.1835","volume":"67","author":"A Georghiou","year":"2019","unstructured":"Georghiou, A., Tsoukalas, A., & Wiesemann, W. (2019). Robust dual dynamic programming. Operations Research, 67(3), 813\u2013830.","journal-title":"Operations Research"},{"issue":"1","key":"6545_CR30","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01585511","volume":"7","author":"SJ Garstka","year":"1974","unstructured":"Garstka, S. J., & Wets, R.J.-B. (1974). On decision rules in stochastic programming. Mathematical Programming, 7(1), 117\u2013143.","journal-title":"Mathematical Programming"},{"issue":"1","key":"6545_CR31","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-009-0331-4","volume":"130","author":"D Kuhn","year":"2011","unstructured":"Kuhn, D., Wiesemann, W., & Georghiou, A. (2011). Primal and dual linear decision rules in stochastic and robust optimization. Mathematical Programming, 130(1), 177\u2013209.","journal-title":"Mathematical Programming"},{"issue":"2","key":"6545_CR32","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke, J., & Ahmed, S. (2008). A sample approximation approach for optimization with probabilistic constraints. SIAM Journal on Optimization, 19(2), 674\u2013699. https:\/\/doi.org\/10.1137\/070702928","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"6545_CR33","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1137\/19M1253447","volume":"30","author":"RP Liu","year":"2020","unstructured":"Liu, R. P. (2020). On feasibility of sample average approximation solutions. SIAM Journal on Optimization, 30(3), 2026\u20132052.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"6545_CR34","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1137\/21M140211X","volume":"32","author":"H Lam","year":"2022","unstructured":"Lam, H., & Li, F. (2022). General feasibility bounds for sample average approximation via Vapnik-Chervonenkis dimension. SIAM Journal on Optimization, 32(2), 1471\u20131497.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"6545_CR35","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s10957-013-0450-1","volume":"163","author":"F Maggioni","year":"2014","unstructured":"Maggioni, F., Allevi, E., & Bertocchi, M. (2014). Bounds in multistage linear stochastic programming. Journal of Optimization Theory and Applications, 163(1), 200\u2013229. https:\/\/doi.org\/10.1007\/s10957-013-0450-1","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"6545_CR36","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10287-016-0254-5","volume":"13","author":"F Maggioni","year":"2016","unstructured":"Maggioni, F., Allevi, E., & Bertocchi, M. (2016). Monotonic bounds in multistage mixed-integer stochastic programming. Computational Management Science, 13(3), 423\u2013457. https:\/\/doi.org\/10.1007\/s10287-016-0254-5","journal-title":"Computational Management Science"},{"issue":"1","key":"6545_CR37","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/140971889","volume":"26","author":"F Maggioni","year":"2016","unstructured":"Maggioni, F., & Pflug, G. C. (2016). Bounds and approximations for multistage stochastic programs. SIAM Journal on Optimization, 26(1), 831\u2013855. https:\/\/doi.org\/10.1137\/140971889","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"6545_CR38","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1137\/17M1140601","volume":"29","author":"F Maggioni","year":"2019","unstructured":"Maggioni, F., & Pflug, G. (2019). Guaranteed bounds for general nondiscrete multistage risk-averse stochastic optimization programs. SIAM Journal on Optimization, 29(1), 454\u2013483. https:\/\/doi.org\/10.1137\/17M1140601","journal-title":"SIAM Journal on Optimization"},{"key":"6545_CR39","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/1-84628-095-8_11","volume-title":"Probabilistic and randomized methods for design under uncertainty","author":"Y Oishi","year":"2006","unstructured":"Oishi, Y. (2006). Probabilistic design of a robust controller using a parameter-dependent Lyapunov function. In G. Calafiore & F. Dabbene (Eds.), Probabilistic and randomized methods for design under uncertainty (pp. 303\u2013316). Springer."},{"issue":"2","key":"6545_CR40","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B. K., Ahmed, S., & Shapiro, A. (2009). Sample average approximation method for chance constrained programming: Theory and applications. Journal of Optimization Theory and Applications, 142(2), 399\u2013416. https:\/\/doi.org\/10.1007\/s10957-009-9523-6","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"6545_CR41","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1287\/ijoc.2016.0696","volume":"28","author":"K Postek","year":"2016","unstructured":"Postek, K., & Hertog, D. (2016). Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set. INFORMS Journal on Computing, 28(3), 553\u2013574. https:\/\/doi.org\/10.1287\/ijoc.2016.0696","journal-title":"INFORMS Journal on Computing"},{"key":"6545_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08843-3","volume-title":"Multistage Stochastic Optimization","author":"GC Pflug","year":"2014","unstructured":"Pflug, G. C., & Pichler, A. (2014). Multistage Stochastic Optimization (Vol. 1104). Springer."},{"issue":"1","key":"6545_CR43","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1287\/msom.1080.0252","volume":"12","author":"G Perakis","year":"2010","unstructured":"Perakis, G., & Roels, G. (2010). Robust controls for network revenue management. Manufacturing & Service Operations Management, 12(1), 56\u201376. https:\/\/doi.org\/10.1287\/msom.1080.0252","journal-title":"Manufacturing & Service Operations Management"},{"issue":"4","key":"6545_CR44","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.orl.2004.08.005","volume":"33","author":"Mc P\u0131nar","year":"2005","unstructured":"P\u0131nar, Mc., & T\u00fct\u00fcnc\u00fc, R. H. (2005). Robust profit opportunities in risky financial portfolios. Operations Research Letters, 33(4), 331\u2013340. https:\/\/doi.org\/10.1016\/j.orl.2004.08.005","journal-title":"Operations Research Letters"},{"key":"6545_CR45","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., & Ruszczy\u0144ski, A. (2009). Lectures on Stochastic programming: Modeling and theory. MPS-SIAM series on optimization. Society for Industrial and Applied Mathematics, Philadelphia. http:\/\/opac.inria.fr\/record=b1130095","DOI":"10.1137\/1.9780898718751"},{"key":"6545_CR46","doi-asserted-by":"crossref","unstructured":"Shapiro, A., & Nemirovski, A. (2005). On complexity of stochastic programming problems. In: Continuous Optimization, pp. 111\u2013146. Springer, Boston, MA.","DOI":"10.1007\/0-387-26771-9_4"},{"issue":"5","key":"6545_CR47","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster, A. L. (1973). Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research, 21(5), 1154\u20131157.","journal-title":"Operations Research"},{"key":"6545_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4610-0","volume-title":"Randomized algorithms for analysis and control of uncertain systems: With applications","author":"R Tempo","year":"2013","unstructured":"Tempo, R., Calafiore, G., Dabbene, F., et al. (2013). Randomized algorithms for analysis and control of uncertain systems: With applications (Vol. 7). Springer."},{"issue":"1","key":"6545_CR49","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/B:ANOR.0000045281.41041.ed","volume":"132","author":"RH T\u00fct\u00fcnc\u00fc","year":"2004","unstructured":"T\u00fct\u00fcnc\u00fc, R. H., & Koenig, M. (2004). Robust asset allocation. Annals of Operations Research, 132(1), 157\u2013187. https:\/\/doi.org\/10.1023\/B:ANOR.0000045281.41041.ed","journal-title":"Annals of Operations Research"},{"issue":"2","key":"6545_CR50","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10957-007-9288-8","volume":"136","author":"A Takeda","year":"2008","unstructured":"Takeda, A., Taguchi, S., & T\u00fct\u00fcnc\u00fc, R. H. (2008). Adjustable robust optimization models for a nonlinear two-period system. Journal of Optimization Theory and Applications, 136(2), 275\u2013295. https:\/\/doi.org\/10.1007\/s10957-007-9288-8","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"6545_CR51","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.automatica.2011.12.002","volume":"48","author":"P Vayanos","year":"2012","unstructured":"Vayanos, P., Kuhn, D., & Rustem, B. (2012). A constraint sampling approach for multi-stage robust optimization. Automatica, 48(3), 459\u2013471.","journal-title":"Automatica"},{"issue":"1","key":"6545_CR52","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10951-006-0326-4","volume":"10","author":"DS Yamashita","year":"2007","unstructured":"Yamashita, D. S., Armentano, V. A., & Laguna, M. (2007). Robust optimization models for project scheduling with resource availability cost. Journal of Scheduling, 10(1), 67\u201376. https:\/\/doi.org\/10.1007\/s10951-006-0326-4","journal-title":"Journal of Scheduling"},{"issue":"3","key":"6545_CR53","doi-asserted-by":"publisher","first-page":"2708","DOI":"10.1109\/TPWRS.2013.2244231","volume":"28","author":"C Zhao","year":"2013","unstructured":"Zhao, C., Wang, J., Watson, J. P., & Guan, Y. (2013). Multi-stage robust unit commitment considering wind and demand response uncertainties. IEEE Transactions on Power Systems, 28(3), 2708\u20132717. https:\/\/doi.org\/10.1109\/TPWRS.2013.2244231","journal-title":"IEEE Transactions on Power Systems"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06545-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06545-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06545-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T16:23:28Z","timestamp":1746721408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06545-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,19]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["6545"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06545-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,19]]},"assertion":[{"value":"11 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Francesca Maggioni declares that she has no conflict of interest. Fabrizio Dabbene declares that he has no conflict of interest. Georg Ch. Pflug declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}