Dynamic programming: a different perspective
Reference24 articles.
1. Bellman, R., Kagiwada, H. and Kalaba, R. (1967), Dynamic programming and an inverse problem in transport theory. Computing, 2: 5–16.
2. Bellman, Richard E. (1957), Dynamic Programming. Princeton University Press.
3. Bird, R. S., and de Moor, O. (1993), From dynamic programming to greedy algorithms. In B. Möller, H. Partsch, and S. Schuman, editors, Formal Program Development, volume 755 of Lecture Notes in Computer Science, pages 43–61.
4. Bird, R. S., and de Moor, O. (1996), The Algebra of Programming. Prentice Hall.
5. Bonzon, P. (1970) Necessary and sufficient conditions for dynamic programming of combinatorial type. Journal of the ACM, 17 (4): 675–682.