Dynamic programming
Programación dinámica
- Date
- 1952 · confidence high
- Place
- RAND Corporation, Santa Monica, California, United States
- Credited to
- Richard E. Bellman
- Field
- Knowledge & symbols
What it is
Working at RAND, Bellman devised a method for solving sequential decision problems by breaking them into simpler subproblems solved backward, formalized as the Bellman equation. It became a central algorithmic paradigm, with applications ranging from Dijkstra's shortest-path algorithm to bioinformatics.
What it led to
- Dijkstra's shortest-path algorithm
- Sequence alignment in bioinformatics
- Formal recognition as a systems engineering area by the IEEE