dynamic programming
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Coined by applied mathematician Richard Bellman in the 1940s.
Noun[edit]
dynamic programming (uncountable)
- (mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.
- 2000, Rein Luus, “Preface”, in Iterative Dynamic Programming[1], CRC Press, →ISBN:
- Dynamic programming, developed by Richard Bellmann, is a powerful method for solving optimization problems. It has the attractive feature of breaking up a complex optimization problem into a number of simpler problems.
Translations[edit]
dynamic programming
|