An Asymptotically Efficient Simulation-Based Algorithm for Finite Horizon Stochastic Dynamic Programming
From MaRDI portal
Publication:5282014
Cited in
(6)- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes
- Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization
- Approximate stochastic annealing for online control of infinite horizon Markov decision processes
- Multi-armed bandits based on a variant of simulated annealing
- Simulation-based rolling horizon scheduling for operating theatres
This page was built for publication: An Asymptotically Efficient Simulation-Based Algorithm for Finite Horizon Stochastic Dynamic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282014)