Minimum-Cost Flow Problems (Section 7.1)(最小费用流问题) A Case Study: The BMZ Maximum Flow Problem (Section 7.2)(案例研究:BMZ公 司的最大流问题) Maximum Flow Problems (Section 7.3)(最大流问题)
8.1 动态规划数学模型Mathematical Model of DP 8.2 资源分配问题 Resource Assignment Problem 8.3 生产与存储问题Production and inventory problem 8.4 背包问题 Knapsack Problem 8.5 其它动态规划模型 Other Model of DP