The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective
Open accessAbstract
Robust optimization typically follows a worst-case perspective, where a single scenario may determine the objective value of a given solution. Accordingly, it is a challenging task to reduce the size of an uncertainty set without changing the resulting objective value too much. On the other hand, robust optimization problems with many scenarios tend to be hard to solve, in particular for two-stage problems. Hence, a reduced uncertainty set may be central to find solutions in reasonable time. We propose scenario reduction methods that give guarantees on the performance of the resulting robust solution. Scenario reduction problems for one- and two-stage robust optimization are framed as optimization problems that only depend on the uncertainty set and not on the underlying decision making problem. Experimental results indicate that objective values for the reduced uncertainty sets are closely correlated to original objective values, resulting in better solutions than when using general-purpose clustering methods such as K-means.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scenario reduction in stochastic programming
Dupa?ov�, J., Gr�we-Kuska, N., & R�misch, W. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0331-0 · Cited by 1,041
Scenario Reduction Algorithms in Stochastic Programming
Heitsch, H., & Römisch, W. (2003) · Computational Optimization and Applications · doi:10.1023/a:1021805924152 · Cited by 982
Min–max and min–max regret versions of combinatorial optimization problems: A survey
Aissi, H., Bazgan, C., & Vanderpooten, D. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2008.09.012 · Cited by 498
A survey of adjustable robust optimization
Yanıkoğlu, İ., Gorissen, B. L., & den Hertog, D. (2018) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.08.031 · Cited by 347
A unified framework for stochastic optimization
Powell, W. B. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.014 · Cited by 314
On the complexity of a class of combinatorial optimization problems with uncertainty
Averbakh, I. (2001) · Mathematical Programming · doi:10.1007/pl00011424 · Cited by 162
Robustness Analysis in Decision Aiding, Optimization, and Analytics
Doumpos, M., Zopounidis, C., & Grigoroudis, E. (2016) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-3-319-33121-8 · Cited by 115
Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization
Bertsimas, D., & Mundru, N. (2022) · Operations Research · doi:10.1287/opre.2022.2265 · Cited by 115
Robust Discrete Optimization Under Discrete and Interval Uncertainty: A Survey
Kasperski, A., & Zieliński, P. (2016) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-3-319-33121-8_6 · Cited by 97
Algorithms and uncertainty sets for data-driven robust shortest path problems
Chassein, A., Dokka, T., & Goerigk, M. (2018) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.10.006 · Cited by 84
Self-citationProblem-driven scenario clustering in stochastic optimization
Keutchayan, J., Ortmann, J., & Rei, W. (2023) · Computational Management Science · doi:10.1007/s10287-023-00446-2 · Cited by 84
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Kasperski, A., Kurpisz, A., & Zieliński, P. (2011) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.08.029 · Cited by 69
Decision-based scenario clustering for decision-making under uncertainty
Hewitt, M., Ortmann, J., & Rei, W. (2021) · Annals of Operations Research · doi:10.1007/s10479-020-03843-x · Cited by 68
Scenario reduction revisited: fundamental limits and guarantees
Rujeerapaiboon, N., Schindler, K., Kühn, D., & Wiesemann, W. (2018) · Mathematical Programming · doi:10.1007/s10107-018-1269-1 · Cited by 66
Rahimian, H., Bayraksan, G., & Homem‐de‐Mello, T. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1224-6 · Cited by 65
Fairbrother, J., Turner, A., & Wallace, S. W. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01451-7 · Cited by 65
Robust placement of sensors in dynamic water distribution systems
Xu, J., Johnson, M. P., Fischbeck, P. S., Small, M. J., & VanBriesen, J. M. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.06.010 · Cited by 62
Robust recoverable and two-stage selection problems
Kasperski, A., & Zieliński, P. (2017) · Discrete Applied Mathematics · doi:10.1016/j.dam.2017.08.014 · Cited by 35
Approximating the min–max (regret) selecting items problem
Kasperski, A., Kurpisz, A., & Zieliński, P. (2012) · Information Processing Letters · doi:10.1016/j.ipl.2012.10.001 · Cited by 31
General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems
Aissi, H., Bazgan, C., & Vanderpooten, D. (2010) · Discrete Optimization · doi:10.1016/j.disopt.2010.03.004 · Cited by 26
A cooperative local search-based algorithm for the Multiple-Scenario Max–Min Knapsack Problem
Sbihi, A. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.05.033 · Cited by 26
On scenario aggregation to approximate robust combinatorial optimization problems
Chassein, A., & Goerigk, M. (2017) · Optimization Letters · doi:10.1007/s11590-017-1206-x · Cited by 12
Self-citationGoerigk, M., & Hughes, M. (2018) · Optimization Letters · doi:10.1007/s11590-018-1348-5 · Cited by 6
Self-citation
Cited by
Zhang, S., Hu, W., Cao, X., Du, J., Zhao, Y., Bai, C. A., Liu, W., Tang, M., Zhan, W., & Chen, Z. (2024) · Applied Energy · doi:10.1016/j.apenergy.2024.123457 · Cited by 47
A machine learning approach to two-stage adaptive robust optimization
Bertsimas, D., & Kim, C. W. (2024) · European Journal of Operational Research · doi:10.1016/j.ejor.2024.06.012 · Cited by 23
Kurtz, J. (2024) · SIAM Journal on Optimization · doi:10.1137/23m1595084 · Cited by 14
Zheng, Z., & Shuang, Q. (2025) · Environmental Impact Assessment Review · doi:10.1016/j.eiar.2025.108119 · Cited by 13
Data-driven prediction of relevant scenarios for robust combinatorial optimization
Goerigk, M., & Kurtz, J. (2024) · Computers & Operations Research · doi:10.1016/j.cor.2024.106886 · Cited by 12
Self-citation
Metadata
- Authors
- Goerigk, M., & Khosravi, M.
- Affiliations
- University of Siegen (DE)
- Corresponding author
- Goerigk, Marc
- ORCID
- Goerigk, Marc
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2023-10
- Volume
- 310
- Issue
- 2
- Pages
- 529-551
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W4327924010
- Cited by
- 20
- References
- 23
- Citations by year
- 2026: 9 · 2025: 3 · 2024: 7 · 2023: 1
- FWCI
- 2.96
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
- doi.org/10.15223/policy-017 (stm-asf)
- doi.org/10.15223/policy-037 (stm-asf)
- doi.org/10.15223/policy-012 (stm-asf)
- doi.org/10.15223/policy-029 (stm-asf)
- doi.org/10.15223/policy-004 (stm-asf)
- Locations
- European Journal of Operational Research (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Funders
- Deutsche Forschungsgemeinschaft (GO 2069/1-1)
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Risk and Portfolio Optimization
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Optimal Power Flow Distribution
- Keywords
- scenario reduction, robust optimization, two-stage robust optimization, worst-case scenario, performance guarantees, clustering
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.