西安电子科技大学计算机学院算法分析与设计 Chapter15（1）.pdfVIP

Design and Analysis of Algorithms Dynamic Programming Reference: CLRS Chapter 15 Topics: • Dynamic Programming (DP) paradigm • Assembly-Line Scheduling • Matrix-Chain Multiplication Huo Hongwei 1 Optimization Problems • A design technique, like divide-and-conquer. • Works bottom-up rather then top-down. • Useful for optimization problems. • Four-step method: 1. Characterize the structure of the optimal solution. 2. Recursively define the value of the optimal solution. 3. Co