Problem-driven scenario clustering in stochastic optimization
From MaRDI portal
Publication:6088772
DOI10.1007/s10287-023-00446-2arXiv2106.11717OpenAlexW3176704067MaRDI QIDQ6088772
Walter Rei, Janosch Ortmann, Julien Keutchayan
Publication date: 14 December 2023
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.11717
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating Scenario Trees for Multistage Decision Problems
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
- Scenario reduction in stochastic programming with respect to discrepancy distances
- Dynamic generation of scenario trees
- Scenario generation for stochastic optimization problems via the sparse grid method
- Scenario reduction in stochastic programming
- Solution sensitivity-based scenario reduction for stochastic unit commitment
- Quality evaluation of scenario-tree generation methods for solving stochastic programming problems
- A heuristic for moment-matching scenario generation
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Stochastic programming and the option of doing it differently
- Problem-based optimal scenario generation and reduction in stochastic programming
- Decision-based scenario clustering for decision-making under uncertainty
- Scenario tree construction driven by heuristic solutions of the optimization problem
- Are quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?
- A stochastic programming approach for supply chain network design under uncertainty
- Computational complexity of stochastic programming problems
- The million-variable ``march for stochastic combinatorial optimization
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
- Mathematical Methods of Organizing and Planning Production
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Modeling with Stochastic Programming
- Capacitated Network Design with Uncertain Demand
- Introduction to Stochastic Programming
- Progressive hedging-based metaheuristics for stochastic network design
- On the Scenario-Tree Optimal-Value Error for Stochastic Programming Problems
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Scenario Reduction Techniques in Stochastic Programming
- The value of the stochastic solution in stochastic linear programs with fixed recourse
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Greedy Strikes Back: Improved Facility Location Algorithms
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems
- Scenario tree generation for multiperiod financial optimization of optimal discretization
- Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization
