Dynamic Programming

Properties of shortest paths are used to introduce dynamic programming and the “principle of optimality”. Polynomial algorithms for uncapacitated lot-sizing and subtree of a tree problems are presented. Next dynamic programming (pseudo-polynomial) algorithms are given for 0-1 and integer knapsack pr... View More