Computational Aspects of Dynamic Programming

Stuart E. Dreyfus · Operations Research · 1957

Dynamic programming is a method of solving multi-stage decision-process problems. Several computational difficulties are characteristic of all dynamic-programming solutions. This paper will attempt to isolate the most important of these difficulties, to examine present techniques, and to suggest areas in which further developments are required.

Read the paper · More papers on PaperTik