Dynamic Programming and Problem-Solving

  • Richard Bellman
Conference paper
Part of the Lecture Notes in Operations Research and Mathematical Systems book series (LNE, volume 28)


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.


Functional Equation Dynamic Program Optimal Policy Digital Computer Markovian Decision Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellman, R., Cooke, K.L. and Lockett, J., Algorithms, Graphs, and Computers. Academic Press Inc., New York, to appearGoogle Scholar
  2. 2.
    Bellman, R., Adaptive Control Processes: A Guided Tour, Princeton University Press, Princeton, New Jersey, 1961MATHGoogle Scholar
  3. 3.
    Bellman, R., “On a Routing Problem,” C. Appl. Math., Vol. 16, pp. 87–90, 1968Google Scholar
  4. 4.
    Bellman, R., “Dynamic Programming Treatment of the Traveling Salesman Problem,” J. Assoc. Comput. Machinery, Vol. 9, pp. 61–63, 1962MATHCrossRefGoogle Scholar
  5. 5.
    Bellman, R., “Dynamic Programming and Difficult Crossing Puzzles,” Math. Mag., January-February, pp. 27–29, 1962Google Scholar
  6. 6.
    Bellman, R., and Cooke, K.L., “The Konigsberg Bridges Problem Generalized,” J. Math. Anal. Appl., Vol. 25, 1969Google Scholar
  7. 7.
    Bellman, R., “On Some Mathematical Recreations,” Amer. Math. Monthly, Vol. 69, pp. 640–643, 1962MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Bellman, R., “Dynamic Programming and Lewis Carroll’s Game of Doublets,” B. Inst. Math, and its Appl., to appearGoogle Scholar
  9. 9.
    Bellman, R., and Gluss, B., “On Various Versions of the Defective Coin Problem,” Information and Control, Vol. 4, pp. 118–131, 1961CrossRefGoogle Scholar
  10. 10.
    Bellman, R., “An Application of Dynamic Programming to the Coloring of Maps, ICC Bull., Vol. 4, pp. 3–6, 1965MathSciNetGoogle Scholar
  11. 11.
    Bellman, R., “Stratification and the Control of Large Systems with Applications to Chess and Checkers,” Information Sciences, Vol. 1, pp. 7–21, 1968CrossRefGoogle Scholar
  12. 12.
    Bellman, R., “On the Application of Dynamic Programming to the Determination of Optimal Play in Chess and Checkers,” Proc. Nat. Acad. Sci. USA, Vol. 53, pp. 244–247, 1965MATHCrossRefGoogle Scholar
  13. 13.
    Howard, R., Dynamic Programming and Markovian Decision Processes, M.I.T. Press, Cambridge, Massachusetts, 1965Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1970

Authors and Affiliations

  • Richard Bellman
    • 1
  1. 1.Department of MathematicsElectrical Engineering, and Medicine University of Southern CaliforniaLos AngelesUSA

Personalised recommendations