Operations Research, Mathematical Programming, Optimization, Algorithms, Discrete Optimization.
instant of the same subproblem, we simply lookup the answer instead of recomputing it. This can be very helpful solving graph problems. The most famous example is the Bellman-Ford algorithm, named after the father of Dynamic Programming Richard Bellman. Sometimes, problems are too tough to solve