|
|
 |
|
阅读资料是由Ahuja, Magnanti, 及Orlin所著的《网络流量：理论、算法及应用》。“AMO选读”指的就是这本书。（朱注：这是作者名的缩写）
The required text is Network Flows: Theory, Algorithms, and Applications by Ahuja, Magnanti, and Orlin. "AMO Reading" refers to this text.
| 1 |
网络模型简介
Introduction to Network Models |
1-22, 53-63 |
| 2 |
计算的复杂性和资料结构
Computational Complexity and Data Structures |
23-38, 765-773 |
| 3 |
图搜寻算法
Graph Search Algorithms |
38-47, 66-79 |
| 4 |
转换和流量分解
Transformations and Flow Decomposition |
79-86 |
| 5 |
最短路径: 标签设置算法
Shortest Paths: Label Setting Algorithms |
93-114 |
| 6 |
基数堆积算法
The Radix Heap Algorithm |
115-124 |
| 7 |
最短路径: 标签订正算法
Shortest Paths: Label Correcting Algorithms |
133-147, 149-150, 154-157 |
| 8 |
最大流量问题之基本算法
Basic Algorithms for The Maximum Flow Problem |
166-187 |
| 9 |
最大流量的组合应用
Combinatorial Applications of Maximum Flows |
188-198 and 207-223 |
| 10 |
预流推进算法
Preflow Push Algorithms |
223-237 |
| 11 |
更多预流推进算法
More on Preflow Push Algorithms |
238-242 |
| 12 |
期中考
Midterm |
|
| 13 |
全域性最小裁减算法
The Global Min Cut Algorithm |
课程讲义
Class Handout |
| 14 |
最少成本流程: 基本算法
Minimum Cost Flows: Basic Algorithms |
294-319 |
| 15 |
连续最短路径算法
The Successive Shortest Path Algorithm |
320-326 |
| 16 |
网络单工算法
The Network Simplex Algorithm |
402-453 |
| 17 |
最少成本跨距树
Minimum Cost Spanning Trees |
510-536 |
| 18 |
线性规划之回顾
Review of Linear Programming |
802-820 |
| 19 |
通用流量
Generalized Flows |
566-592 |
| 20 |
拉式(Lagrangian)释限法 1
Lagrangian Relaxation 1 |
598-615 |
| 21 |
拉式(Lagrangian)释限法 2
Lagrangian Relaxation 2 |
615-638 |
| 22 |
多元物品流量
Multicommodity Flows |
649-671 |
| 23 |
多元物品流量
Multicommodity Flows |
671-683 |
| 24 |
非常大规模之邻域搜寻法
Very Large Scale Neighborhood Search |
课程讲义
Class Handout |
|
|
|
|
|
 |
|
