On the Scenario-Tree Optimal-Value Error for Stochastic Programming Problems
From MaRDI portal
Publication:3387936
DOI10.1287/moor.2019.1043zbMath1456.90112OpenAlexW3036346356MaRDI QIDQ3387936
David Munger, Julien Keutchayan, Michel Gendreau
Publication date: 8 January 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2019.1043
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating Scenario Trees for Multistage Decision Problems
- A comment on ``Computational complexity of stochastic programming problems
- Stochastic optimization methods in finance and energy. New financial products and energy market strategies. Selected papers based on the presentations at the spring school of stochastic programming, Bergamo, Italy, April 10--20, 2007, and the 11th international symposium on stochastic programming (SPXI), Vienna, Austria, August 27--31, 2007
- The smoothing effect of the ANOVA decomposition
- Dynamic generation of scenario trees
- Epi-convergent discretizations of multistage stochastic programs via integration quadratures
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Scenario tree modeling for multistage stochastic programs
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- A simulation-based approach to two-stage stochastic programming with recourse
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Scenario reduction in stochastic programming
- Epi-convergent discretizations of stochastic programs via integration quadratures
- Quality evaluation of scenario-tree generation methods for solving stochastic programming problems
- Designing robust emergency medical service via stochastic programming
- A heuristic for moment-matching scenario generation
- Scenario reduction algorithms in stochastic programming
- Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
- Are quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?
- Variance reduction in sample approximations of stochastic programs
- Computational complexity of stochastic programming problems
- Convergence theory for nonconvex stochastic programming with an application to mixed logit
- Monte Carlo and quasi-Monte Carlo sampling
- On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
- Modeling with Stochastic Programming
- QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND
- A Distance For Multistage Stochastic Optimization Models
- Introduction to Stochastic Programming
- Stability of Multistage Stochastic Programs
- On Rates of Convergence for Stochastic Optimization Problems Under Non–Independent and Identically Distributed Sampling
- Approximations for Probability Distributions and Stochastic Optimization Problems
- On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
- The smoothing effect of integration in $\mathbb {R}^d$ and the ANOVA decomposition
- Reproducing kernels of Sobolev spaces on ℝd and applications to embedding constants and tractability
- Scenario tree generation for multiperiod financial optimization of optimal discretization
