The following pages link to Approximate Dynamic Programming (Q5310431):
Displayed 41 items.
- Generalized Markov models of infectious disease spread: a novel framework for developing dynamic health policies (Q420890) (← links)
- The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems (Q421584) (← links)
- Network revenue management with inventory-sensitive bid prices and customer choice (Q421775) (← links)
- Approximate dynamic programming for capacity allocation in the service industry (Q439484) (← links)
- Approximate dynamic programming with Bézier curves/surfaces for top-percentile traffic routing (Q439572) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Sampled fictitious play for approximate dynamic programming (Q547121) (← links)
- The method of endogenous gridpoints with occasionally binding constraints among endogenous variables (Q602989) (← links)
- Model-free \(H_{\infty }\) control design for unknown linear discrete-time systems via Q-learning with LMI (Q608439) (← links)
- Suboptimal solutions to dynamic optimization problems via approximations of the policy functions (Q613579) (← links)
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553) (← links)
- Stochastic control via direct comparison (Q633815) (← links)
- Multi-player non-zero-sum games: online adaptive learning solution of coupled Hamilton-Jacobi equations (Q642894) (← links)
- Computation of approximate optimal policies in a partially observed inventory model with rain checks (Q642900) (← links)
- Optimal Bayesian strategies for the infinite-armed Bernoulli bandit (Q643377) (← links)
- A dynamic programming strategy to balance exploration and exploitation in the bandit problem (Q647433) (← links)
- Approximation of Markov decision processes with general state space (Q663675) (← links)
- Approximate dynamic programming via direct search in the space of value function approximations (Q713118) (← links)
- Discrete neural dynamic programming in wheeled mobile robot control (Q718550) (← links)
- Synergies of operations research and data mining (Q976388) (← links)
- Optimally maintaining a Markovian deteriorating system with limited imperfect repairs (Q976454) (← links)
- Partially observable Markov decision process approximations for adaptive sensing (Q977009) (← links)
- Monotone optimal replacement policies for a Markovian deteriorating system in a controllable environment (Q991463) (← links)
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
- Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
- Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains (Q1959632) (← links)
- VALUING CALLABLE AND PUTABLE REVENUE-PERFORMANCE-LINKED PROJECT BACKED SECURITIES (Q2786035) (← links)
- Approximate policy iteration: a survey and some new methods (Q2887629) (← links)
- A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications (Q2887630) (← links)
- Approximate dynamic programming with state aggregation applied to UAV perimeter patrol (Q2903989) (← links)
- Shrinking-horizon dynamic programming (Q3064037) (← links)
- Decomposing inventory routing problems with approximate value functions (Q3065633) (← links)
- Performance bounds and suboptimal policies for linear stochastic control via LMIs (Q3098498) (← links)
- Strategic capacity decision-making in a stochastic manufacturing environment using real-time approximate dynamic programming (Q3553741) (← links)
- An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system (Q3553742) (← links)
- What you should know about simulation and derivatives (Q3612294) (← links)
- Opportunistic Transmission over Randomly Varying Channels (Q3616977) (← links)
- What you should know about approximate dynamic programming (Q3621932) (← links)
- Value and Policy Function Approximations in Infinite-Horizon Optimization Problems (Q3626047) (← links)
- APPROXIMATE DYNAMIC PROGRAMMING TECHNIQUES FOR THE CONTROL OF TIME-VARYING QUEUING SYSTEMS APPLIED TO CALL CENTERS WITH ABANDONMENTS AND RETRIALS (Q5305593) (← links)
- Randomized Shortest-Path Problems: Two Related Models (Q5323768) (← links)