The following pages link to Approximate Dynamic Programming (Q5310431):
Displaying 50 items.
- Approximating convex functions via non-convex oracles under the relative noise model (Q1751103) (← links)
- Dynamic booking control for car rental revenue management: a decomposition approach (Q1752267) (← links)
- A dynamic programming model of energy storage and transformer deployments to relieve distribution constraints (Q1789573) (← links)
- Numerical solutions to dynamic portfolio problems with upper bounds (Q1789606) (← links)
- A stochastic control formalism for dynamic biologically conformal radiation therapy (Q1926672) (← links)
- Optimal patient and personnel scheduling policies for care-at-home service facilities (Q1926675) (← links)
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming (Q1926680) (← links)
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results (Q1949593) (← links)
- Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains (Q1959632) (← links)
- Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues (Q1991289) (← links)
- A mathematical model for personalized advertisement in virtual reality environments (Q2014370) (← links)
- On infinite horizon active fault diagnosis for a class of non-linear non-Gaussian systems (Q2018404) (← links)
- Applications of stochastic modeling in air traffic management: methods, challenges and opportunities for solving air traffic problems under uncertainty (Q2030538) (← links)
- Counterfactual regret minimization for integrated cyber and air defense resource allocation (Q2030546) (← links)
- A dynamic programming framework for optimal delivery time slot pricing (Q2030595) (← links)
- Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees (Q2059319) (← links)
- Bias-policy iteration based adaptive dynamic programming for unknown continuous-time linear systems (Q2063829) (← links)
- Anticipative dynamic slotting for attended home deliveries (Q2068855) (← links)
- Deep reinforcement learning for inventory control: a roadmap (Q2076812) (← links)
- An application of approximate dynamic programming in multi-period multi-product advertising budgeting (Q2083404) (← links)
- Adaptive optimal output tracking of continuous-time systems via output-feedback-based reinforcement learning (Q2097732) (← links)
- High-precision computational guidance in terminal phase with impact angle, lead angle and lateral acceleration constraints (Q2109150) (← links)
- Learning surrogate functions for the short-horizon planning in same-day delivery problems (Q2117229) (← links)
- Two-stage linear decision rules for multi-stage stochastic programming (Q2118081) (← links)
- Homotopic policy iteration-based learning design for unknown linear continuous-time systems (Q2123225) (← links)
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups (Q2140335) (← links)
- Approximate dynamic programming for an energy-efficient parallel machine scheduling problem (Q2140360) (← links)
- Resilient reinforcement learning and robust output regulation under denial-of-service attacks (Q2151879) (← links)
- Dynamic pooled capacity deployment for urban parcel logistics (Q2158021) (← links)
- Model-free finite-horizon optimal tracking control of discrete-time linear systems (Q2161893) (← links)
- Time-optimal control of large-scale systems of systems using compositional optimization (Q2177769) (← links)
- Efficient algorithms of pathwise dynamic programming for decision optimization in mining operations (Q2178364) (← links)
- The stochastic shortest path problem: a polyhedral combinatorics perspective (Q2183321) (← links)
- An online stochastic algorithm for a dynamic nurse scheduling problem (Q2183326) (← links)
- Dynamic dispatching and repositioning policies for fast-response service networks (Q2183864) (← links)
- Improved value iteration for neural-network-based stochastic optimal control design (Q2185716) (← links)
- Robust min-max optimal control design for systems with uncertain models: a neural dynamic programming approach (Q2185769) (← links)
- MIDAS: a mixed integer dynamic approximation scheme (Q2188240) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Off-policy learning for adaptive optimal output synchronization of heterogeneous multi-agent systems (Q2207209) (← links)
- New insight into the simultaneous policy update algorithms related to \(H_\infty\) state feedback control (Q2213098) (← links)
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities (Q2216197) (← links)
- Optimal control of nonlinear systems with dynamic programming (Q2235316) (← links)
- ``Regression anytime'' with brute-force SVD truncation (Q2240846) (← links)
- Managing mobile production-inventory systems influenced by a modulation process (Q2241563) (← links)
- Prospect-theoretic Q-learning (Q2242939) (← links)
- Improved SVRG for finite sum structure optimization with application to binary classification (Q2244210) (← links)
- Cooperative and non-cooperative behaviour in the exploitation of a common renewable resource with environmental stochasticity (Q2245795) (← links)
- Dynamic multi-appointment patient scheduling for radiation therapy (Q2253376) (← links)
- Determining near optimal base-stock levels in two-stage general inventory systems (Q2255950) (← links)
