Sensitivity-based nested partitions for solving finite-horizon Markov decision processes
From MaRDI portal
Recommendations
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes
- An Heuristic for Multi-Dimensional Markov Decision Processes
- Policy-based branch-and-bound for infinite-horizon multi-model Markov decision processes
- An Adaptive Sampling Algorithm for Solving Markov Decision Processes
- Piecewise Linear Approximations for Partially Observable Markov Decision Processes with Finite Horizons
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 51708 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 5685899 (Why is no real title available?)
- A survey of some simulation-based algorithms for Markov decision processes
- A tutorial on event-based optimization -- a new optimization framework
- An Adaptive Sampling Algorithm for Solving Markov Decision Processes
- An optimization framework for product design
- Approximate Dynamic Programming
- Dynamic programming and optimal control. Vol. 1.
- Nested Partitions Method for Global Optimization
- Nested Partitions and Its Applications to the Intermodal Hub Location Problem
- On Solving Optimal Policies for Finite-Stage Event-Based Optimization
- Perturbation realization, potentials, and sensitivity analysis of Markov processes
- Stochastic learning and optimization. A sensitivity-based approach.
Cited in
(1)
This page was built for publication: Sensitivity-based nested partitions for solving finite-horizon Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1728313)