15 Dynamic Programming 15.1 Rod cutting 15.2 Matrix-chain multiplication 15.3 Elements of dynamic programming 15.4 Longest common subsequence 15.5 Optimal binary search trees Problems