{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:59:45Z","timestamp":1772553585646,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T00:00:00Z","timestamp":1678838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T00:00:00Z","timestamp":1678838400000},"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":[[2023,12]]},"DOI":"10.1007\/s10287-023-00446-2","type":"journal-article","created":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T06:02:30Z","timestamp":1678860150000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Problem-driven scenario clustering in stochastic optimization"],"prefix":"10.1007","volume":"20","author":[{"given":"Julien","family":"Keutchayan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3811-6047","authenticated-orcid":false,"given":"Janosch","family":"Ortmann","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Rei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,15]]},"reference":[{"key":"446_CR1","unstructured":"Arthur D, Vassilvitskii S (2006) k-means++: the advantages of careful seeding. Technical Report 2006-13, Stanford InfoLab. http:\/\/ilpubs.stanford.edu:8090\/778\/"},{"issue":"3","key":"446_CR2","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1287\/msom.1070.0182","volume":"10","author":"O Baron","year":"2008","unstructured":"Baron O, Berman O, Krass D (2008) Facility location with stochastic demand and constraints on waiting time. Manuf Serv Oper Manag 10(3):484\u2013505","journal-title":"Manuf Serv Oper Manag"},{"key":"446_CR3","doi-asserted-by":"crossref","unstructured":"Bengio Y, Frejinger E, Lodi A, Patel R, Sankaranarayanan S (2019) A learning-based algorithm to quickly compute good primal solutions for stochastic integer programs. CoRR arXiv:1912.08112","DOI":"10.1007\/978-3-030-58942-4_7"},{"key":"446_CR4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2265","author":"D Bertsimas","year":"2022","unstructured":"Bertsimas D, Mundru N (2022) Optimization-based scenario reduction for data-driven two-stage stochastic optimization. Oper Res. https:\/\/doi.org\/10.1287\/opre.2022.2265","journal-title":"Oper Res"},{"key":"446_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.omega.2015.02.006","volume":"55","author":"M Bieniek","year":"2015","unstructured":"Bieniek M (2015) A note on the facility location problem with stochastic demands. Omega 55:53\u201360","journal-title":"Omega"},{"key":"446_CR6","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/BF01585113","volume":"24","author":"JR Birge","year":"1982","unstructured":"Birge JR (1982) The value of the stochastic solution in stochastic linear programs with fixed recourse. Math Program 24:314\u2013325","journal-title":"Math Program"},{"key":"446_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"2011","unstructured":"Birge JR, Louveaux F (2011) Introduction to stochastic programming, 2nd edn. Springer, New York","edition":"2"},{"issue":"3","key":"446_CR8","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1007\/s10589-015-9751-7","volume":"62","author":"M Chen","year":"2015","unstructured":"Chen M, Mehrotra S, Papp D (2015) Scenario generation for stochastic optimization problems via the sparse grid method. Comput Optim Appl 62(3):669\u2013692","journal-title":"Comput Optim Appl"},{"issue":"2","key":"446_CR9","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1002\/net.20456","volume":"58","author":"TG Crainic","year":"2011","unstructured":"Crainic TG, Fu X, Gendreau M, Rei W, Wallace SW (2011) Progressive hedging-based metaheuristics for stochastic network design. Networks 58(2):114\u2013124","journal-title":"Networks"},{"key":"446_CR10","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.cor.2013.08.020","volume":"43","author":"TG Crainic","year":"2014","unstructured":"Crainic TG, Hewitt M, Rei W (2014) Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design. Comput Oper Res 43:90\u201399","journal-title":"Comput Oper Res"},{"key":"446_CR55","unstructured":"de Vos NJ (2015) kmodes categorical clustering library. https:\/\/github.com\/nicodv\/kmodes"},{"key":"446_CR11","doi-asserted-by":"crossref","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 an approach using probability metrics. Math Program Ser A 95:493\u2013511","journal-title":"Math Program Ser A"},{"issue":"3","key":"446_CR12","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-005-0597-0","volume":"106","author":"M Dyer","year":"2006","unstructured":"Dyer M, Stougie L (2006) Computational complexity of stochastic programming problems. Math Program Ser A 106(3):423\u2013432","journal-title":"Math Program Ser A"},{"issue":"1","key":"446_CR13","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1287\/mnsc.2020.3922","volume":"68","author":"AN Elmachtoub","year":"2022","unstructured":"Elmachtoub AN, Grigas P (2022) Smart \u2018predict, then optimize\u2019. Manag Sci 68(1):9\u201326","journal-title":"Manag Sci"},{"key":"446_CR14","first-page":"1","volume":"2019","author":"J Fairbrother","year":"2019","unstructured":"Fairbrother J, Turner A, Wallace SW (2019) Problem-driven scenario generation: an analytical approach for stochastic programs with tail risk measure. Math Program 2019:1\u201342","journal-title":"Math Program"},{"issue":"1","key":"446_CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10287-014-0220-z","volume":"13","author":"Y Feng","year":"2016","unstructured":"Feng Y, Ryan SM (2016) Solution sensitivity-based scenario reduction for stochastic unit commitment. Comput Manag Sci 13(1):29\u201362","journal-title":"Comput Manag Sci"},{"issue":"1","key":"446_CR16","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha S, Khuller S (1999) Greedy strikes back: improved facility location algorithms. J Algorithms 31(1):228\u2013248","journal-title":"J Algorithms"},{"key":"446_CR17","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2011","unstructured":"Han J, Pei J, Kamber M (2011) Data mining: concepts and techniques. Elsevier, Amsterdam"},{"issue":"3","key":"446_CR18","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10589-016-9843-z","volume":"65","author":"H Heitsch","year":"2016","unstructured":"Heitsch H, Le\u00f6vey H, R\u00f6misch W (2016) Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs? Comput Optim Appl 65(3):567\u2013603","journal-title":"Comput Optim Appl"},{"key":"446_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10589-007-9123-z","volume":"43","author":"R Henrion","year":"2009","unstructured":"Henrion R, K\u00fcchler C, R\u00f6misch W (2009) Scenario reduction in stochastic programming with respect to discrepancy distances. Comput Optim Appl 43:67\u201393","journal-title":"Comput Optim Appl"},{"key":"446_CR20","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"},{"key":"446_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-020-03843-x","author":"M Hewitt","year":"2021","unstructured":"Hewitt M, Ortmann J, Rei W (2021) Decision-based scenario clustering for decision-making under uncertainty. Ann Oper Res. https:\/\/doi.org\/10.1007\/s10479-020-03843-x","journal-title":"Ann Oper Res"},{"issue":"3","key":"446_CR22","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1287\/moor.16.3.650","volume":"16","author":"JL Higle","year":"1991","unstructured":"Higle JL, Sen S (1991) Stochastic decomposition: an algorithm for two-stage linear programs with recourse. Math Oper Res 16(3):650\u2013669","journal-title":"Math Oper Res"},{"key":"446_CR23","unstructured":"Ho N, Nguyen X, Yurochkin M, Bui HH, Huynh V, Phung D (2017) Multilevel clustering via wasserstein means. In: International Conference on Machine Learning, pp 1501\u20131509"},{"issue":"3","key":"446_CR24","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z Huang","year":"1998","unstructured":"Huang Z (1998) Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Min Knowl Discov 2(3):283\u2013304","journal-title":"Data Min Knowl Discov"},{"issue":"2\u20133","key":"446_CR25","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/A:1021853807313","volume":"24","author":"K H\u00f8yland","year":"2003","unstructured":"H\u00f8yland K, Kaut M, Wallace SW (2003) A heuristic for moment-matching scenario generation. Comput Optim Appl 24(2\u20133):169\u2013185","journal-title":"Comput Optim Appl"},{"issue":"2","key":"446_CR26","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/mnsc.47.2.295.9834","volume":"42","author":"K H\u00f8yland","year":"2001","unstructured":"H\u00f8yland K, Wallace SW (2001) Generating scenario trees for multistage decision problems. Manag Sci 42(2):295\u2013307","journal-title":"Manag Sci"},{"key":"446_CR27","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice-Hall Inc, Upper Saddle River, NJ"},{"issue":"4","key":"446_CR28","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"LV Kantorovich","year":"1939","unstructured":"Kantorovich LV (1939) Mathematical methods of organizing and planning production. Manag Sci 6(4):366\u2013422","journal-title":"Manag Sci"},{"key":"446_CR29","first-page":"77","volume-title":"Modeling with stochastic programming","author":"M Kaut","year":"2012","unstructured":"Kaut M (2012) Scenario-tree generation. In: King AJ, Wallace SW (eds) Modeling with stochastic programming. Springer, New York, pp 77\u2013102"},{"issue":"3","key":"446_CR30","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10287-017-0279-4","volume":"14","author":"J Keutchayan","year":"2017","unstructured":"Keutchayan J, Gendreau M, Saucier A (2017) Quality evaluation of scenario-tree generation methods for solving stochastic programming problems. Comput Manag Sci 14(3):333\u2013365","journal-title":"Comput Manag Sci"},{"issue":"4","key":"446_CR31","doi-asserted-by":"crossref","first-page":"1572","DOI":"10.1287\/moor.2019.1043","volume":"45","author":"J Keutchayan","year":"2020","unstructured":"Keutchayan J, Munger D, Gendreau M (2020) On the scenario-tree optimal-value error for stochastic programming problems. Math Oper Res 45(4):1572\u20131595","journal-title":"Math Oper Res"},{"key":"446_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-87817-1","volume-title":"Modeling with stochastic programming","author":"AJ King","year":"2012","unstructured":"King AJ, Wallace SW (2012) Modeling with stochastic programming. Springer, New York"},{"issue":"2","key":"446_CR33","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt AJ, Shapiro A, Homem-de-Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J Optim 12(2):479\u2013502","journal-title":"SIAM J Optim"},{"key":"446_CR34","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ic.2012.01.007","volume":"222","author":"S Li","year":"2013","unstructured":"Li S (2013) A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf Comput 222:45\u201358","journal-title":"Inf Comput"},{"issue":"2","key":"446_CR35","doi-asserted-by":"crossref","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 J Optim 19(2):674\u2013699","journal-title":"SIAM J Optim"},{"issue":"36","key":"446_CR36","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.21105\/joss.01230","volume":"4","author":"A Novikov","year":"2019","unstructured":"Novikov A (2019) PyClustering: data mining library. J Open Source Softw 4(36):1230. https:\/\/doi.org\/10.21105\/joss.01230","journal-title":"J Open Source Softw"},{"issue":"3","key":"446_CR37","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10898-004-5910-6","volume":"32","author":"L Ntaimo","year":"2005","unstructured":"Ntaimo L, Sen S (2005) The million-variable \u201cmarch\u2019\u2019 for stochastic combinatorial optimization. J Glob Optim 32(3):385\u2013400","journal-title":"J Glob Optim"},{"key":"446_CR38","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M, Duchesnay E (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"issue":"2","key":"446_CR39","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/PL00011398","volume":"89","author":"GC Pflug","year":"2001","unstructured":"Pflug GC (2001) Scenario tree generation for multiperiod financial optimization by optimal discretization. Math Program 89(2):251\u2013271","journal-title":"Math Program"},{"issue":"3","key":"446_CR40","doi-asserted-by":"crossref","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","journal-title":"Comput Optim Appl"},{"key":"446_CR41","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10287-020-00369-2","volume":"17","author":"V Prochazka","year":"2020","unstructured":"Prochazka V, Wallace SW (2020) Scenario tree construction driven by heuristic solutions of the optimization problem. Comput Manag Sci 17:277\u2013307","journal-title":"Comput Manag Sci"},{"issue":"1","key":"446_CR42","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/17M1128204","volume":"28","author":"R Rahmaniani","year":"2018","unstructured":"Rahmaniani R, Crainic TG, Gendreau M, Rei W (2018) Accelerating the benders decomposition method: application to stochastic network design problems. SIAM J Optim 28(1):875\u2013903","journal-title":"SIAM J Optim"},{"issue":"1","key":"446_CR43","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/17M1128204","volume":"28","author":"R Rahmaniani","year":"2018","unstructured":"Rahmaniani R, Crainic TG, Gendreau M, Rei W (2018) Accelerating the benders decomposition method: application to stochastic network design problems. SIAM J Optim 28(1):875\u2013903","journal-title":"SIAM J Optim"},{"issue":"3","key":"446_CR44","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/ijoc.14.3.247.111","volume":"14","author":"M Riis","year":"2002","unstructured":"Riis M, Andersen KA (2002) Capacitated network design with uncertain demand. INFORMS J Comput 14(3):247\u2013260","journal-title":"INFORMS J Comput"},{"key":"446_CR45","volume-title":"Variational analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar RT, Wets RJ-B (2009) Variational analysis, vol 317. Springer, New York"},{"key":"446_CR46","first-page":"1","volume":"2018","author":"N Rujeerapaiboon","year":"2018","unstructured":"Rujeerapaiboon N, Schindler K, Kuhn D, Wiesemann W (2018) Scenario reduction revisited: fundamental limits and guarantees. Math Program 2018:1\u201336","journal-title":"Math Program"},{"key":"446_CR47","first-page":"1","volume-title":"Stochastic algorithms: foundations and applications","author":"W R\u00f6misch","year":"2009","unstructured":"R\u00f6misch W (2009) Scenario reduction techniques in stochastic programming. In: Watanabe O, Zeugmann T (eds) Stochastic algorithms: foundations and applications. Springer, Berlin, Heidelberg, pp 1\u201314"},{"issue":"1","key":"446_CR48","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ejor.2004.01.046","volume":"167","author":"T Santoso","year":"2005","unstructured":"Santoso T, Ahmed S, Goetschalckx M, Shapiro A (2005) A stochastic programming approach for supply chain network design under uncertainty. Eur J Oper Res 167(1):96\u2013115","journal-title":"Eur J Oper Res"},{"key":"446_CR49","doi-asserted-by":"crossref","unstructured":"Schubert E, Rousseeuw PJ (2019) Faster k-medoids clustering: improving the pam, clara, and clarans algorithms. In: International Conference on Similarity Search and Applications, Springer, pp 171\u2013187","DOI":"10.1007\/978-3-030-32047-8_16"},{"issue":"2","key":"446_CR50","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-005-0658-4","volume":"105","author":"R Schultz","year":"2006","unstructured":"Schultz R, Tiedemann S (2006) Conditional value-at-risk in stochastic programs with mixed-integer recourse. Math Program 105(2):365\u2013386","journal-title":"Math Program"},{"issue":"1","key":"446_CR51","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/S1052623498349541","volume":"11","author":"A Shapiro","year":"2000","unstructured":"Shapiro A, Homem-de-Mello T (2000) On the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs. SIAM J Optim 11(1):70\u201386","journal-title":"SIAM J Optim"},{"key":"446_CR52","first-page":"353","volume-title":"Handbooks in operations research and management science: stochastic programming","author":"A Shapiro","year":"2003","unstructured":"Shapiro A (2003) Monte Carlo sampling methods. In: Ruszczy\u0144ski A, Shapiro A (eds) Handbooks in operations research and management science: stochastic programming, vol 10. Elsevier, Amsterdam, pp 353\u2013425"},{"key":"446_CR53","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1016\/j.energy.2017.12.154","volume":"145","author":"M Sun","year":"2018","unstructured":"Sun M, Teng F, Konstantelos I, Strbac G (2018) An objective-based scenario selection method for transmission network expansion planning with multivariate stochasticity in load and renewable energy sources. Energy 145:871\u2013885","journal-title":"Energy"},{"issue":"1","key":"446_CR54","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-009-0600-x","volume":"177","author":"SW Wallace","year":"2010","unstructured":"Wallace SW (2010) Stochastic programming and the option of doing it differently. Ann Oper Res 177(1):3\u20138","journal-title":"Ann Oper Res"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00446-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00446-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00446-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T21:40:32Z","timestamp":1701466832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00446-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,15]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["446"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00446-2","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,15]]},"assertion":[{"value":"7 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}