View on Coursera Course Description This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic ...

Silvano Martello, David Pisinger, Paolo Toth, Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem, Management Science, Vol. 45, No. 3 (Mar., 1999), pp ...

Richard Bellman, Some Problems in the Theory of Dynamic Programming, Econometrica, Vol. 22, No. 1 (Jan., 1954), pp. 37-48 ...

1. CodeChef CodeChef lets you choose among thousands of problems to practice skills like sorting, data structures, and dynamic programming. Problems are sortable by difficulty.

Dynamic programming algorithms are a good place to start understanding what's really going on inside computational biology software. The heart of many well-known programs is a dynamic programming ...