Dynamic Programming and Problem-Solving
A device that can perform the elementary operations of arithmetic rapidly and accurately and store the results of these calculations in order to use them at appropriate times according to assigned instructions necessarily must exert a strong influence upon any field in which significant problems can be quantized. It is obvious therefore that the digital computer plays a role of increasing importance in science and engineering. What is not as clear is the magnitude or kind of influence. The second computer revolution, the overthrow of the concepts and methodology of the seventeenth and eighteenth centuries, will be far more dramatic than the first which consisted merely in an accelerated use of the methods and methodology of these bygone eras.
Unable to display preview. Download preview PDF.
- 1.Bellman, R., Cooke, K.L. and Lockett, J., Algorithms, Graphs, and Computers. Academic Press Inc., New York, to appearGoogle Scholar
- 3.Bellman, R., “On a Routing Problem,” C. Appl. Math., Vol. 16, pp. 87–90, 1968Google Scholar
- 5.Bellman, R., “Dynamic Programming and Difficult Crossing Puzzles,” Math. Mag., January-February, pp. 27–29, 1962Google Scholar
- 6.Bellman, R., and Cooke, K.L., “The Konigsberg Bridges Problem Generalized,” J. Math. Anal. Appl., Vol. 25, 1969Google Scholar
- 8.Bellman, R., “Dynamic Programming and Lewis Carroll’s Game of Doublets,” B. Inst. Math, and its Appl., to appearGoogle Scholar
- 13.Howard, R., Dynamic Programming and Markovian Decision Processes, M.I.T. Press, Cambridge, Massachusetts, 1965Google Scholar