Shortest Route Methods for Finite State Space Deterministic Dynamic Programming Problems
- 1 November 1968
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 16 (6) , 1232-1250
- https://doi.org/10.1137/0116104
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A Decomposition Algorithm for Shortest Paths in a NetworkOperations Research, 1968
- Turnpike Planning Horizons for a Markovian Decision ModelManagement Science, 1968
- A Finite Renewal Algorithm for the Knapsack and Turnpike ModelsOperations Research, 1967
- Negative Dynamic ProgrammingThe Annals of Mathematical Statistics, 1966
- On the Iterative Method of Dynamic Programming on a Finite Space Discrete Time Markov ProcessThe Annals of Mathematical Statistics, 1965
- Applied Dynamic ProgrammingPublished by Walter de Gruyter GmbH ,1962
- Discrete Dynamic ProgrammingThe Annals of Mathematical Statistics, 1962
- Dynamic Version of the Economic Lot Size ModelManagement Science, 1958
- On the graphs and asymptotic forms of finite boolean relation matrices and stochastic matricesNaval Research Logistics Quarterly, 1957