Pages that link to "Item:Q1066821"

The following pages link to Generalized polynomial approximations in Markovian decision processes (Q1066821):

Displaying 41 items.

• Approximate dynamic programming for stochastic linear control problems on compact state spaces (Q299794) (← links)
• Approximate linear programming for networks: average cost bounds (Q342031) (← links)
• Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (Q648368) (← links)
• Practical solution techniques for first-order MDPs (Q835833) (← links)
• Symmetric approximate linear programming for factored MDPs with application to constrained problems (Q870814) (← links)
• Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path (Q1009248) (← links)
• A methodology for computation reduction for specially structured large scale Markov decision problems (Q1092822) (← links)
• Optimal recovery strategies for manufacturing systems (Q1129927) (← links)
• Relationship between least squares Monte Carlo and approximate linear programming (Q1728294) (← links)
• A polyhedral approach to online bipartite matching (Q1801015) (← links)
• Feature-based methods for large scale dynamic programming (Q1911341) (← links)
• State partitioning based linear program for stochastic dynamic programs: an invariance property (Q1939695) (← links)
• Hybrid least-squares algorithms for approximate policy evaluation (Q1959511) (← links)
• Data-driven optimal control with a relaxed linear program (Q2063818) (← links)
• Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network (Q2239873) (← links)
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
• Dynamic multi-appointment patient scheduling for radiation therapy (Q2253376) (← links)
• A strong Lagrangian relaxation for general discrete-choice network revenue management (Q2419547) (← links)
• Computational bounds for elevator control policies by large scale linear programming (Q2441574) (← links)
• Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty (Q2450902) (← links)
• Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
• A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← links)
• Efficient compact linear programs for network revenue management (Q2688923) (← links)
• Reductions of Approximate Linear Programs for Network Revenue Management (Q2797458) (← links)
• Linear Programming and the Control of Diffusion Processes (Q2802245) (← links)
• Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program (Q2806066) (← links)
• Computing Near-Optimal Policies in Generalized Joint Replenishment (Q2815435) (← links)
• Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← 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)
• Performance bounds and suboptimal policies for linear stochastic control via LMIs (Q3098498) (← links)
• A Polyhedral Approach to Online Bipartite Matching (Q3186510) (← links)
• Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
• (Q4969260) (← links)
• Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
• (Q5168869) (← links)
• Approximate dynamic programming via iterated Bellman inequalities (Q5256802) (← links)
• Value function approximation via linear programming for FMS scheduling (Q5750698) (← links)
• The actor-critic algorithm as multi-time-scale stochastic approximation. (Q5955801) (← links)
• Reductions of non-separable approximate linear programs for network revenue management (Q6167751) (← links)
• MF-OMO: An Optimization Formulation of Mean-Field Games (Q6188322) (← links)