Tag: richard-bellman

Bellman-Ford generalized shortest-path computation to weighted graphs with negative edges and added a decisive test for negative cycles, using repeated relaxation rather than a greedy frontier.

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.