Approximate dynamic programming methods for an inventory allocation problem under uncertainty
From MaRDI portal
Recommendations
- An approximate dynamic-programming approach to the joint replenishment problem
- Approximations of Dynamic, Multilocation Production and Inventory Problems
- Approximate dynamic programming. Solving the curses of dimensionality
- Linear programming based decomposition methods for inventory distribution systems
- Approximate Dynamic Programming
Cites work
Cited in
(11)- An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
- A duality-based relaxation and decomposition approach for inventory distribution systems
- Spare parts inventory management with substitution-dependent reliability
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem
- Dynamic programming on the probabilistic inventory problems with multiple piecewise cost functions
- Approximate dynamic programming for the military inventory routing problem
- A refined deterministic linear program for the network revenue management problem with customer choice behavior
- Optimizing (\(s, S\)) policies for multi-period inventory models with demand distribution uncertainty: robust dynamic programing approaches
- Interval quadratic programming for day-ahead dispatch of uncertain predicted demand
- Dynamic programming algorithms for multi-stage safety stock optimization
- Dynamic programming in inventory management: a review
This page was built for publication: Approximate dynamic programming methods for an inventory allocation problem under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424512)