Aggregation in Dynamic Programming
From MaRDI portal
Publication:3773725
DOI10.1287/opre.35.2.215zbMath0634.90091OpenAlexW2095876516MaRDI QIDQ3773725
John R. Birge, Robert L. Smith, James C. Bean
Publication date: 1987
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.35.2.215
Related Items (max. 100)
Conditions for the discovery of solution horizons ⋮ Revenue management for operations with urgent orders ⋮ Approximate dynamic programming with state aggregation applied to UAV perimeter patrol ⋮ Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive ⋮ On computing average cost optimal policies with application to routing to parallel queues ⋮ Degeneracy in infinite horizon optimization ⋮ State partitioning based linear program for stochastic dynamic programs: an invariance property ⋮ A survey of dynamic network flows ⋮ Network-Based Approximate Linear Programming for Discrete Optimization ⋮ Parameterized Markov decision process and its application to service rate control ⋮ Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse ⋮ An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
This page was built for publication: Aggregation in Dynamic Programming
