What you should know about approximate dynamic programming
From MaRDI portal
Publication:3621932
DOI10.1002/nav.20347zbMath1158.90418OpenAlexW2062457326MaRDI QIDQ3621932
Publication date: 22 April 2009
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20347
stochastic optimizationMonte Carlo simulationreinforcement learningapproximate dynamic programmingneuro-dynamic programming
Related Items
Undiscounted control policy generation for continuous-valued optimal control by approximate dynamic programming ⋮ Project planning with alternative technologies in uncertain environments ⋮ Approximate dynamic programming for the dispatch of military medical evacuation assets ⋮ A stochastic model for the patient-bed assignment problem with random arrivals and departures ⋮ Dynamic appointment scheduling with wait-dependent abandonment ⋮ Stochastic optimization for real time service capacity allocation under random service demand ⋮ Three ways to solve partial differential equations with neural networks — A review ⋮ Nonmyopic and pseudo-nonmyopic approaches to optimal sequential design in the presence of covariates ⋮ Optimized ensemble value function approximation for dynamic programming ⋮ Dynamic surgery management under uncertainty ⋮ The dynamic bowser routing problem ⋮ Literature review on multi-appointment scheduling problems in hospitals ⋮ Approximate dynamic programming for missile defense interceptor fire control ⋮ Price optimization with reference price effects: a generalized Benders' decomposition method and a myopic heuristic approach ⋮ A Bayesian learning model for estimating unknown demand parameter in revenue management ⋮ Controlled approximation of the value function in stochastic dynamic programming for multi-reservoir systems ⋮ Deep hedging of long-term financial derivatives ⋮ An approximate dynamic programming approach for comparing firing policies in a networked air defense environment ⋮ A perturbation approach to approximate value iteration for average cost Markov decision processes with Borel spaces and bounded costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulation-based algorithms for Markov decision processes.
- Feature Article: Optimization for simulation: Theory vs. Practice
- Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
- Functional Approximations and Dynamic Programming
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Adaptive aggregation methods for infinite horizon dynamic programming
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Introduction to Stochastic Programming
- Introduction to Stochastic Search and Optimization
- Approximate Dynamic Programming
- The elements of statistical learning. Data mining, inference, and prediction
