01
Richard Bellman and Dynamic Programming: Solving Decisions by Reusing Subproblems
Richard Bellman turned multistage decision problems into a recursive method in which later optimal choices are reused to solve earlier ones, creating dynamic programming as a general algorithmic strategy.
↗