Aggregation in Dynamic Programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4195735
- Efficient Dynamic Aggregation
- On temporal aggregators and dynamic programming
- A General Approach to Aggregation Problems
- scientific article; zbMATH DE number 53073
- scientific article; zbMATH DE number 5866260
- scientific article; zbMATH DE number 1260458
- scientific article; zbMATH DE number 1431652
- Dynamic programming
Cited in
(15)- Degeneracy in infinite horizon optimization
- On computing average cost optimal policies with application to routing to parallel queues
- Aggregation in large-scale optimization
- State partitioning based linear program for stochastic dynamic programs: an invariance property
- Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
- On temporal aggregators and dynamic programming
- 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
- Adaptive aggregation methods for infinite horizon dynamic programming
- Parameterized Markov decision process and its application to service rate control
- Network-based approximate linear programming for discrete optimization
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- A survey of dynamic network flows
This page was built for publication: Aggregation in Dynamic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773725)
