Dynamic Programming Internal Reports


Maintained by Moshe Sniedovich and Gavin Cole


Bean, J.C. and Smith, R.L., Conditions for the existence of planning horizons, Technical Report # 81-8, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan, 1981.

Bellman, R., An introduction to the theory of dynamic programming, R-245, The Rand Corporation, Santa Monica, California, 1953a.

Brown, Q.E., Dynamic programming in computer science, Technical Report CMU-CS-79-106, Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pa, 1979.

Domingo, A. and Sniedovich, M., Experiments with dynamic programming algorithms for nonseparable problems, Preprint Series No. 8-1991, Department of Mathematics, The University of Melbourne, Melbourne, 1991.

Ellis, D., An abstract setting of the notion of dynamic programming, P-783, The Rand Corporation, Santa Monica, California, 1955.

Karlin, S. and Shapiro, H.N., Decision processes and functional equations, RM-933, The Rand Corporation, Santa Monica, California, 1952.

Lawler, E.L., Efficient implementation of dynamic programming algorithms for sequencing problems, BW 106/79, Department of Operations Research, Mathematical Center, Amsterdam, The Netherlands, 1979.

Martelli, A., and Montanari, U., From dynamic programming to search algorithms with functional costs, Internal Report B75-1, Instituto di Elaborazione Della Informazione, Piza, Italy, 1975

Pollock, S.M. and Smith, R.L., A formalism of dynamic programming, Technical Report 85-8, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbour, Michigan, 1985.


Crawl back to DP Bibliography

Crawl back to WORMS