{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T02:24:04Z","timestamp":1761791044273,"version":"build-2065373602"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:00:00Z","timestamp":1755993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:00:00Z","timestamp":1755993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10287-025-00542-5","type":"journal-article","created":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T20:35:36Z","timestamp":1756067736000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tree approximation of scenario processes for multistage stochastic optimization: algorithms and fast implementations"],"prefix":"10.1007","volume":"22","author":[{"given":"Kipngeno Benard","family":"Kirui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg Ch.","family":"Pflug","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8876-2429","authenticated-orcid":false,"given":"Alois","family":"Pichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,24]]},"reference":[{"key":"542_CR1","unstructured":"Altschuler J, Weed J, Rigollet P (2017) Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pages 1961\u20131971. Curran Associates Inc., https:\/\/arxiv.org\/abs\/1705.09634"},{"issue":"1","key":"542_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1111\/j.0960-1627.2005.00213.x","volume":"15","author":"V Bally","year":"2005","unstructured":"Bally V, Pag\u00e8s G, Printems J (2005) A quantization tree method for pricing and hedging multidimensional American options. Math Financ 15(1):119\u2013168. https:\/\/doi.org\/10.1111\/j.0960-1627.2005.00213.x","journal-title":"Math Financ"},{"key":"542_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800080314","volume-title":"Adaptive control processes. Princeton Legacy Library 2045","author":"RE Bellman","year":"1961","unstructured":"Bellman RE (1961) Adaptive control processes. Princeton Legacy Library 2045. Princeton University Press, Princeton. https:\/\/doi.org\/10.1002\/nav.3800080314 (ISBN 978-1-4008-7466-8)"},{"key":"542_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9096-9","volume-title":"Reproducing Kernel Hilbert Spaces in Probability and Statistics","author":"A Berlinet","year":"2004","unstructured":"Berlinet A, Thomas-Agnan C (2004) Reproducing Kernel Hilbert Spaces in Probability and Statistics. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-1-4419-9096-9"},{"key":"542_CR5","unstructured":"Bertsimas D, Mundru N (2021) Optimization-based scenario reduction for data-driven two-stage stochastic optimization. preprint"},{"key":"542_CR6","doi-asserted-by":"publisher","unstructured":"Bohn B, Griebel M (2012) An adaptive sparse grid approach for timeseries prediction. In Lecture Notes in Computational Science and Engineering. Springer, Berlin, pp 1\u201330. https:\/\/doi.org\/10.1007\/978-3-642-31703-3_1","DOI":"10.1007\/978-3-642-31703-3_1"},{"key":"542_CR7","doi-asserted-by":"publisher","unstructured":"Bolley F (2008) Separability and completeness for the Wasserstein distance. In: Donati-Martin C, \u00c9mery M, Rouault A, Stricker C (eds) S\u00e9minaire de Probabilit\u00e9s XLI, volume 1934 of Lecture Notes in Mathematics. Springer, Berlin, pp 371\u2013377. https:\/\/doi.org\/10.1007\/978-3-540-77913-1","DOI":"10.1007\/978-3-540-77913-1"},{"issue":"3\u20134","key":"542_CR8","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s00440-006-0004-7","volume":"137","author":"F Bolley","year":"2007","unstructured":"Bolley F, Guillin A, Villani C (2007) Quantitative concentration inequalities for empirical measures on non-compact spaces. Probab Theory Relat Fields 137(3\u20134):541\u2013593. https:\/\/doi.org\/10.1007\/s00440-006-0004-7. (ISSN 0178-8051.)","journal-title":"Probab Theory Relat Fields"},{"key":"542_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1019206915174","volume":"100","author":"G Consigli","year":"2000","unstructured":"Consigli G, Dupa\u010dov\u00e1 J, Wallace SW (2000) Generating scenarios for multistage stochastic programs. Ann Oper Res 100:25\u201353. https:\/\/doi.org\/10.1023\/A:1019206915174","journal-title":"Ann Oper Res"},{"issue":"3 and 4","key":"542_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"GB Dantzig","year":"1955","unstructured":"Dantzig GB (1955) Linear programming under uncertainty. Manage Sci 1(3 and 4):197\u2013206","journal-title":"Manage Sci"},{"key":"542_CR11","unstructured":"Ding L, Ahmed S, Shapiro A (2020) A Python package for multi-stage stochasticprogramming. http:\/\/www.optimization-online.org\/DB_FILE\/2019\/05\/7199.pdf. optimization online"},{"issue":"1","key":"542_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1287\/ijoc.2020.0987","volume":"33","author":"O Dowson","year":"2020","unstructured":"Dowson O, Kapelevich L (2020) SDDP.jl: a Julia package for stochastic dual dynamic programming. INFORMS J Comput 33(1):27\u201333. https:\/\/doi.org\/10.1287\/ijoc.2020.0987","journal-title":"INFORMS J Comput"},{"issue":"1","key":"542_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1214\/aoms\/1177697802","volume":"40","author":"RM Dudley","year":"1969","unstructured":"Dudley RM (1969) The speed of mean Glivenko-Cantelli convergence. Ann Math Stat 40(1):40\u201350","journal-title":"Ann Math Stat"},{"issue":"3","key":"542_CR14","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. Math Program Ser A 95(3):493\u2013511. https:\/\/doi.org\/10.1007\/s10107-002-0331-0","journal-title":"Math Program Ser A"},{"key":"542_CR15","doi-asserted-by":"publisher","unstructured":"Graf S, Luschgy H (2000) Foundations of Quantization for Probability Distributions, volume 1730 of Lecture Notes in Mathematics. Springer-Verlag, Berlin. https:\/\/doi.org\/10.1007\/BFb0103945","DOI":"10.1007\/BFb0103945"},{"issue":"5","key":"542_CR16","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.orl.2012.04.006","volume":"40","author":"V Guigues","year":"2012","unstructured":"Guigues V, R\u00f6misch W (2012) SDDP for multistage stochastic linear programs based on spectral risk measures. Oper Res Lett 40(5):313\u2013318. https:\/\/doi.org\/10.1016\/j.orl.2012.04.006","journal-title":"Oper Res Lett"},{"issue":"1","key":"542_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10107-015-0896-z","volume":"151","author":"GA Hanasusanto","year":"2015","unstructured":"Hanasusanto GA, Roitch V, Kuhn D, Wiesemann W (2015) A distributionally robust perspective on uncertainty quantification and chance constrained programming. Math Program 151(1):35\u201362. https:\/\/doi.org\/10.1007\/s10107-015-0896-z","journal-title":"Math Program"},{"issue":"1","key":"542_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.2307\/1403432","volume":"65","author":"W H\u00e4rdle","year":"1997","unstructured":"H\u00e4rdle W, L\u00fctkepohl H, Chen R (1997) A review of nonparametric time series analysis. Int Stat Rev 65(1):49\u201372. https:\/\/doi.org\/10.2307\/1403432","journal-title":"Int Stat Rev"},{"key":"542_CR19","volume-title":"Clustering Algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan JA (1975) Clustering Algorithms. Wiley, New York"},{"key":"542_CR20","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/j.orl.2006.12.008","volume":"6","author":"H Heitsch","year":"2007","unstructured":"Heitsch H, R\u00f6misch W (2007) A note on scenario reduction for two-stage stochastic programs. Oper Res Lett 6:731\u2013738","journal-title":"Oper Res Lett"},{"key":"542_CR21","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10287-008-0087-y","volume":"2","author":"H Heitsch","year":"2009","unstructured":"Heitsch H, R\u00f6misch W (2009) Scenario tree reduction for multistage stochastic programs. CMS 2:117\u2013133. https:\/\/doi.org\/10.1007\/s10287-008-0087-y","journal-title":"CMS"},{"key":"542_CR22","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-007-0197-2","volume":"118","author":"H Heitsch","year":"2009","unstructured":"Heitsch H, R\u00f6misch W (2009) Scenario tree modeling for multistage stochastic programs. Math Program Ser A 118:371\u2013406. https:\/\/doi.org\/10.1007\/s10107-007-0197-2","journal-title":"Math Program Ser A"},{"key":"542_CR23","doi-asserted-by":"publisher","unstructured":"Heitsch H, R\u00f6misch W (2011) Stability and scenario trees for multistage stochastic programs. In: Infanger G (ed) Stochastic Programming, volume 150 of International Series in Operations Research and Management Science, chapter 7. Springer, New York, pp 139\u2013164. ISBN 978-1-4419-1641-9. https:\/\/doi.org\/10.1007\/978-1-4419-1642-6","DOI":"10.1007\/978-1-4419-1642-6"},{"issue":"2","key":"542_CR24","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/050632865","volume":"17","author":"H Heitsch","year":"2006","unstructured":"Heitsch H, R\u00f6misch W, Strugarek C (2006) Stability of multistage stochastic programs. SIAM J Optim 17(2):511\u2013525","journal-title":"SIAM J Optim"},{"key":"542_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1337-6","author":"R Henrion","year":"2018","unstructured":"Henrion R, R\u00f6misch W (2018) Problem-based optimal scenario generation and reduction in stochastic programming. Math Program. https:\/\/doi.org\/10.1007\/s10107-018-1337-6","journal-title":"Math Program"},{"issue":"1","key":"542_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10589-007-9123-z","volume":"43","author":"R Henrion","year":"2007","unstructured":"Henrion R, K\u00fcchler C, R\u00f6misch W (2007) Scenario reduction in stochastic programming with respect to discrepancy distances. Comput Optim Appl 43(1):67\u201393. https:\/\/doi.org\/10.1007\/s10589-007-9123-z","journal-title":"Comput Optim Appl"},{"key":"542_CR27","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/mnsc.47.2.295.9834","volume":"47","author":"K H\u00f8yland","year":"2001","unstructured":"H\u00f8yland K, Wallace SW (2001) Generating scenario trees for multistage decision problems. Manage Sci 47:295\u2013307. https:\/\/doi.org\/10.1287\/mnsc.47.2.295.9834","journal-title":"Manage Sci"},{"key":"542_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/b98838","volume-title":"Foundations of Modern Probability","author":"O Kallenberg","year":"2002","unstructured":"Kallenberg O (2002) Foundations of Modern Probability. Springer, New York. https:\/\/doi.org\/10.1007\/b98838"},{"issue":"1\u20132","key":"542_CR29","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10287-009-0110-y","volume":"8","author":"M Kaut","year":"2011","unstructured":"Kaut M, Wallace SW (2011) Shape-based scenario generation using copulas. CMS 8(1\u20132):181\u2013199. https:\/\/doi.org\/10.1007\/s10287-009-0110-y","journal-title":"CMS"},{"issue":"46","key":"542_CR30","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.21105\/joss.01912","volume":"5","author":"KB Kirui","year":"2020","unstructured":"Kirui KB, Pichler A, Pflug GC (2020) ScenTrees.jl: a Julia package for generating scenario trees and scenario lattices for multistage stochastic programming. J Open Sour Softw 5(46):1912. https:\/\/doi.org\/10.21105\/joss.01912","journal-title":"J Open Sour Softw"},{"issue":"11","key":"542_CR31","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1287\/mnsc.48.11.1512.261","volume":"48","author":"P Klaassen","year":"2002","unstructured":"Klaassen P (2002) Comment on generating scenario trees for multistage decision problems. Manage Sci 48(11):1512\u20131516. https:\/\/doi.org\/10.1287\/mnsc.48.11.1512.261","journal-title":"Manage Sci"},{"key":"542_CR32","doi-asserted-by":"publisher","unstructured":"Kovacevic RM, Pichler A (2015) Tree approximation for discrete time stochastic processes: a process distance approach. Annals of Operations Research, pp 1\u201327. https:\/\/doi.org\/10.1007\/s10479-015-1994-2","DOI":"10.1007\/s10479-015-1994-2"},{"issue":"1","key":"542_CR33","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/wics.57","volume":"2","author":"H Kushner","year":"2010","unstructured":"Kushner H (2010) Stochastic approximation: a survey. Wiley Interdiscip Rev Computat Stat 2(1):87\u201396. https:\/\/doi.org\/10.1002\/wics.57. (ISSN 1939-0068.)","journal-title":"Wiley Interdiscip Rev Computat Stat"},{"key":"542_CR34","doi-asserted-by":"publisher","unstructured":"Kushner HJ, Yin GG (2003) Stochastic Approximation and Recursive Algorithms and Applications, volume 35 of Stochastic Modelling and Applied Probability, 2nd edn. Springer. https:\/\/doi.org\/10.1007\/b97441","DOI":"10.1007\/b97441"},{"issue":"10","key":"542_CR35","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.3390\/e25101435","volume":"25","author":"R Lakshmanan","year":"2023","unstructured":"Lakshmanan R, Pichler A (2023) Soft quantization using entropic regularization. Entropy 25(10):1435. https:\/\/doi.org\/10.3390\/e25101435","journal-title":"Entropy"},{"key":"542_CR36","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1553\/etna_vol58s289","volume":"58","author":"R Lakshmanan","year":"2023","unstructured":"Lakshmanan R, Pichler A, Potts D (2023) Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm. ETNA - Electron Trans Numer Anal 58:289\u2013315. https:\/\/doi.org\/10.1553\/etna_vol58s289","journal-title":"ETNA - Electron Trans Numer Anal"},{"issue":"1","key":"542_CR37","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.ejor.2016.05.021","volume":"255","author":"N L\u00f6hndorf","year":"2016","unstructured":"L\u00f6hndorf N (2016) An empirical analysis of scenario generation methods for stochastic optimization. Eur J Oper Res 255(1):121\u2013132. https:\/\/doi.org\/10.1016\/j.ejor.2016.05.021","journal-title":"Eur J Oper Res"},{"issue":"2","key":"542_CR38","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.ejor.2018.08.001","volume":"273","author":"N L\u00f6hndorf","year":"2019","unstructured":"L\u00f6hndorf N, Shapiro A (2019) Modeling time-dependent randomness in stochastic dual dynamic programming. Eur J Oper Res 273(2):650\u2013661. https:\/\/doi.org\/10.1016\/j.ejor.2018.08.001","journal-title":"Eur J Oper Res"},{"issue":"4","key":"542_CR39","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1287\/opre.2013.1182","volume":"61","author":"N L\u00f6hndorf","year":"2013","unstructured":"L\u00f6hndorf N, Wozabal D, Minner S (2013) Optimizing trading decisions for hydro storage systems using approximate dual dynamic programming. Oper Res 61(4):810\u2013823. https:\/\/doi.org\/10.1287\/opre.2013.1182","journal-title":"Oper Res"},{"issue":"1","key":"542_CR40","doi-asserted-by":"publisher","first-page":"77","DOI":"10.2307\/2975974","volume":"7","author":"HM Markowitz","year":"1952","unstructured":"Markowitz HM (1952) Portfolio selection. J Financ 7(1):77\u201391. https:\/\/doi.org\/10.2307\/2975974","journal-title":"J Financ"},{"issue":"11","key":"542_CR41","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1515\/156939605777438578","volume":"11","author":"G Pag\u00e8s","year":"2005","unstructured":"Pag\u00e8s G, Printems J (2005) Functional quantization for numerics with an application to option pricing. Monte Carlo Methods Appl 11(11):407\u2013446. https:\/\/doi.org\/10.1515\/156939605777438578","journal-title":"Monte Carlo Methods Appl"},{"key":"542_CR42","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s101070000202","volume":"89","author":"GC Pflug","year":"2001","unstructured":"Pflug GC (2001) Scenario tree generation for multiperiod financial optimization by optimal discretization. Math Program 89:251\u2013271. https:\/\/doi.org\/10.1007\/s101070000202","journal-title":"Math Program"},{"key":"542_CR43","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1137\/080718401","volume":"20","author":"GC Pflug","year":"2009","unstructured":"Pflug GC (2009) Version-independence and nested distributions in multistage stochastic optimization. SIAM J Optim 20:1406\u20131420. https:\/\/doi.org\/10.1137\/080718401","journal-title":"SIAM J Optim"},{"issue":"1","key":"542_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/110825054","volume":"22","author":"GC Pflug","year":"2012","unstructured":"Pflug GC, Pichler A (2012) A distance for multistage stochastic optimization models. SIAM J Optim 22(1):1\u201323. https:\/\/doi.org\/10.1137\/110825054","journal-title":"SIAM J Optim"},{"key":"542_CR45","doi-asserted-by":"publisher","unstructured":"Pflug GC, Pichler A (2014) Multistage Stochastic Optimization. Springer Series in Operations Research and Financial Engineering. Springer, ISBN 978-3-319-08842-6. https:\/\/doi.org\/10.1007\/978-3-319-08843-3. https:\/\/books.google.com\/books?id=q_VWBQAAQBAJ","DOI":"10.1007\/978-3-319-08843-3"},{"issue":"3","key":"542_CR46","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10589-015-9758-0","volume":"62","author":"GC Pflug","year":"2015","unstructured":"Pflug GC, Pichler A (2015) Dynamic generation of scenario trees. Comput Optim Appl 62(3):641\u2013668. https:\/\/doi.org\/10.1007\/s10589-015-9758-0","journal-title":"Comput Optim Appl"},{"issue":"3","key":"542_CR47","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1137\/15M1043376","volume":"26","author":"GC Pflug","year":"2016","unstructured":"Pflug GC, Pichler A (2016) From empirical observations to tree models for stochastic optimization: convergence properties. SIAM J Optim 26(3):1715\u20131740. https:\/\/doi.org\/10.1137\/15M1043376","journal-title":"SIAM J Optim"},{"key":"542_CR48","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10287-021-00415-7","volume":"19","author":"A Pichler","year":"2021","unstructured":"Pichler A, Weinhardt M (2021) The nested Sinkhorn divergence to compute the nested distance. CMS 19:269\u2013293. https:\/\/doi.org\/10.1007\/s10287-021-00415-7","journal-title":"CMS"},{"issue":"2","key":"542_CR49","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10287-015-0230-5","volume":"12","author":"I Rios","year":"2015","unstructured":"Rios I, Wets RJ-B, Woodruff DL (2015) Multi-period forecasting and scenario generation with limited data. CMS 12(2):267\u2013295. https:\/\/doi.org\/10.1007\/s10287-015-0230-5","journal-title":"CMS"},{"issue":"1","key":"542_CR50","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar RT, Wets RJ-B (1991) Scenarios and policy aggregation in optimization under uncertainty. Math Oper Res 16(1):119\u2013147. https:\/\/doi.org\/10.1287\/moor.16.1.119","journal-title":"Math Oper Res"},{"key":"542_CR51","volume-title":"Stochastic Programming, Handbooks in Operations Research and Management Science, volume 10, chapter 8","author":"W R\u00f6misch","year":"2003","unstructured":"R\u00f6misch W (2003) Stability of stochastic programming problems. In: Ruszczy\u0144ski A, Shapiro A (eds) Stochastic Programming, Handbooks in Operations Research and Management Science, volume 10, chapter 8. Elsevier, Amsterdam"},{"issue":"2","key":"542_CR52","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1137\/100811696","volume":"22","author":"W R\u00f6misch","year":"2012","unstructured":"R\u00f6misch W, Guigues V (2012) Sampling-based decomposition methods for multistage stochastic programs based on extended polyhedral risk measures. SIAM J Optim 22(2):286\u2013312. https:\/\/doi.org\/10.1137\/100811696","journal-title":"SIAM J Optim"},{"key":"542_CR53","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02204819","volume":"30","author":"W R\u00f6misch","year":"1991","unstructured":"R\u00f6misch W, Schultz R (1991) Stability analysis for stochastic programs. Ann Oper Res 30:241\u2013266. https:\/\/doi.org\/10.1007\/BF02204819","journal-title":"Ann Oper Res"},{"issue":"1","key":"542_CR54","doi-asserted-by":"publisher","first-page":"35","DOI":"10.21105\/jcon.00035","volume":"1","author":"AW Rosemberg","year":"2020","unstructured":"Rosemberg AW, Street A, Garcia JD, Silva T, Vallad\u00e3o DM, Dowson O (2020) HydroPowerModels.jl: a Julia\/JuMP package for hydrothermal economic dispatch optimization. JuliaCon Proc 1(1):35. https:\/\/doi.org\/10.21105\/jcon.00035","journal-title":"JuliaCon Proc"},{"issue":"3","key":"542_CR55","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1016\/j.ejor.2016.11.028","volume":"259","author":"S S\u00e9guin","year":"2017","unstructured":"S\u00e9guin S, Fleten S-E, C\u00f4t\u00e9 P, Pichler A, Audet C (2017) Stochastic short-term hydropower planning with inflow scenario trees. Eur Oper Res 259(3):1156\u20131168. https:\/\/doi.org\/10.1016\/j.ejor.2016.11.028","journal-title":"Eur Oper Res"},{"key":"542_CR56","doi-asserted-by":"publisher","unstructured":"Shapiro A, Nemirovski A (2005) On complexity of stochastic programming problems. In: Jeyakumar V, Rubinov AM, (eds) Continuous Optimization: Current Trends and Applications. Springer, pp 111\u2013144. https:\/\/doi.org\/10.1007\/0-387-26771-9_4","DOI":"10.1007\/0-387-26771-9_4"},{"issue":"4","key":"542_CR57","doi-asserted-by":"publisher","first-page":"402","DOI":"10.2307\/2314570","volume":"74","author":"R Sinkhorn","year":"1967","unstructured":"Sinkhorn R (1967) Diagonal equivalence to matrices with prescribed row and column sums. Am Math Mon 74(4):402. https:\/\/doi.org\/10.2307\/2314570","journal-title":"Am Math Mon"},{"key":"542_CR58","doi-asserted-by":"publisher","first-page":"343","DOI":"10.2140\/pjm.1967.21.343","volume":"21","author":"R Sinkhorn","year":"1967","unstructured":"Sinkhorn R, Knopp P (1967) Concerning nonnegative matrices and doubly stochastic matrices. Pac J Math 21:343\u2013348 (ISSN 0030-8730)","journal-title":"Pac J Math"},{"key":"542_CR59","doi-asserted-by":"publisher","DOI":"10.1007\/b13794","volume-title":"Introduction to Nonparametric Estimation","author":"AB Tsybakov","year":"2008","unstructured":"Tsybakov AB (2008) Introduction to Nonparametric Estimation. Springer, New York. https:\/\/doi.org\/10.1007\/b13794"},{"key":"542_CR60","doi-asserted-by":"publisher","unstructured":"Villani C (2003) Topics in Optimal Transportation, volume 58 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, ISBN 0-821-83312-X. https:\/\/doi.org\/10.1090\/gsm\/058. http:\/\/books.google.com\/books?id=GqRXYFxe0l0C","DOI":"10.1090\/gsm\/058"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-025-00542-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-025-00542-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-025-00542-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T02:19:47Z","timestamp":1761790787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-025-00542-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,24]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["542"],"URL":"https:\/\/doi.org\/10.1007\/s10287-025-00542-5","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"type":"print","value":"1619-697X"},{"type":"electronic","value":"1619-6988"}],"subject":[],"published":{"date-parts":[[2025,8,24]]},"assertion":[{"value":"14 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 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":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"14"}}