Information relaxation bounds for infinite horizon Markov decision processes
From MaRDI portal
(Redirected from Publication:4598650)
Recommendations
- Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
- Approximations to stochastic dynamic programs via information relaxation duality
- Information relaxations and duality in stochastic dynamic programs
- Balancing exploitation and exploration in discrete optimization via simulation through a Gaussian process-based search
- Relaxations of Weakly Coupled Stochastic Dynamic Programs
Cited in
(10)- A novel decomposition-based method for solving general-product structure assemble-to-order systems
- Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
- Balancing exploitation and exploration in discrete optimization via simulation through a Gaussian process-based search
- Information relaxations and duality in stochastic dynamic programs
- Order now, pickup in 30 minutes: managing queues with static delivery guarantees
- Asymptotically optimal appointment schedules
- Approximations to stochastic dynamic programs via information relaxation duality
- Pathwise dynamic programming
- Technical Note—On the Strength of Relaxations of Weakly Coupled Stochastic Dynamic Programs
- Job scheduling integrated with material ordering: decision-dependent stochastic programming and information relaxation dual bounds
This page was built for publication: Information relaxation bounds for infinite horizon Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598650)