Computational complexity of stochastic programming: Monte Carlo sampling approach
From MaRDI portal
Recommendations
Cited in
(13)- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- A stability result for linear Markovian stochastic optimization problems
- On the information-based complexity of stochastic programming
- Computational complexity of stochastic programming problems
- Tree approximation for discrete time stochastic processes: a process distance approach
- A comment on ``Computational complexity of stochastic programming problems
- On the computational complexity and generalization properties of multi-stage and stage-wise coupled scenario programs
- The computational complexity of stochastic optimization
- Computational Complexity Analysis for Monte Carlo Approximations of Classically Scaled Population Processes
- On complexity of stochastic programming problems
- Expected residual minimization formulation for stochastic absolute value equations
- Weighted Birkhoff averages: deterministic and probabilistic perspectives
- Stochastic programming approach to optimization under uncertainty
This page was built for publication: Computational complexity of stochastic programming: Monte Carlo sampling approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096726)