Perspectives of approximate dynamic programming
From MaRDI portal
Publication:333093
DOI10.1007/s10479-012-1077-6zbMath1348.90612OpenAlexW2109634117MaRDI QIDQ333093
Publication date: 9 November 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1077-6
Related Items
Replacement and inventory control for a multi-customer product service system with decreasing replacement costs ⋮ New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups ⋮ Approximate dynamic programming for an energy-efficient parallel machine scheduling problem ⋮ A perturbation approach to a class of discounted approximate value iteration algorithms with Borel spaces ⋮ A stochastic model for the patient-bed assignment problem with random arrivals and departures ⋮ Dynamic community partitioning for e-commerce last mile delivery with time window constraints ⋮ Augmented simulation methods for discrete stochastic optimization with recourse ⋮ Demand management for attended home delivery -- a literature review ⋮ Symmetry reduction for dynamic programming ⋮ Managing mobile production-inventory systems influenced by a modulation process ⋮ Learning excursion sets of vector-valued Gaussian random fields for autonomous ocean sampling ⋮ Maximizing the probability of attaining a target prior to extinction ⋮ A perturbation approach to approximate value iteration for average cost Markov decision processes with Borel spaces and bounded costs ⋮ An aggregation-based approximate dynamic programming approach for the periodic review model with random yield
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scenario tree modeling for multistage stochastic programs
- Associative search network: A reinforcement learning associative memory
- The art and theory of dynamic programming
- Asynchronous stochastic approximation and Q-learning
- Rollout algorithms for stochastic scheduling problems
- \({\mathcal Q}\)-learning
- Bayesian look ahead one-stage sampling allocations for selection of the best population
- Introduction to the mathematical theory of control processes. Vol. II:Nonlinear processes
- Finite state Markovian decision processes
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- Linear Programming under Uncertainty
- The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain Demand
- On Sequential Decisions and Markov Chains
- SMART: A Stochastic Multiscale Model for the Analysis of Energy Resources, Technology, and Policy
- Approximate policy iteration: a survey and some new methods
- A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications
- The Knowledge Gradient Algorithm for a General Class of Online Learning Problems
- Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
- The Knowledge-Gradient Policy for Correlated Normal Beliefs
- Feature Article—Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming
- The Knowledge-Gradient Algorithm for Sequencing Experiments in Drug Discovery
- Multi‐Armed Bandit Allocation Indices
- Approximate Dynamic Programming
- Functional Approximations and Dynamic Programming
- A Knowledge-Gradient Policy for Sequential Information Collection
- Using Ranking and Selection to “Clean Up” after Simulation Optimization
- The Multi-Armed Bandit Problem: Decomposition and Computation
- On the Convergence of Stochastic Iterative Dynamic Programming Algorithms
- Optimal Adaptive Policies for Markov Decision Processes
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- Introduction to Stochastic Programming
- An analysis of temporal-difference learning with function approximation
- An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
- Introduction to Stochastic Search and Optimization
- A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
- Approximate Dynamic Programming
- Denumerable State Markovian Decision Processes-Average Cost Criterion
- A Stochastic Approximation Method
- Scenarios for multistage stochastic programs
