| Month |
Day |
Topics |
Reading |
Jan.
|
17
|
Introduction, Conduct of Course |
|
| |
19
|
Network flow problems, applications |
Chapter 1 |
| |
24
|
Network representations, Network transformations |
Chapter 2 |
| |
26 |
Network transformations |
2. |
|
31
|
Complexity Analysis, search algorithms |
3.1-3.4 |
| Feb. |
2 |
Flow decomposition |
3.5 |
| |
7
|
Shortest path problems, tree of shortest paths |
4.1-4.3 |
| |
9
|
Dijkstra's Algorithm, Dial's implementation, Heap
implementations |
4.5-4.7 |
| |
14
|
Optimality conditions, label-correcting algorithms |
5.1-5.3 |
| |
16
|
More label-correcting, detecting negative cycles, all pairs
shortest
path problem |
5.4-5.6 |
| |
21
|
Maximum flow problems |
6.1-6.2 |
|
23
|
Flows and cuts, generic augmenting path algorithm |
6.3-6.4 |
| |
28 |
Labeling algorithm and the Max-flow Min-Cut theorem, |
6.5-6.6 |
| Mar. |
2
|
Flows with lower bounds |
6.7 |
| |
7
|
Distance labels, capacity scaling algorithm, |
7.1-7.3 |
| |
9
|
Shortest augmenting path algorithm |
7.4 |
| |
14 |
Preflow-Push algorithm |
7.6 |
| |
16
|
Minimum cost flows |
9.1-9.2 |
|
20-24
|
Spring
Break
|
|
| |
28 |
Optimality conditions, duality |
9.3-9.4 |
| |
30
|
Midterm
Exam -- (in class, closed book)
|
9.5-9.6 |
| Apr. . |
4 |
Node potentials, cycle-canceling algorithm |
|
| |
6
|
|
|
| |
11 |
Successive shortest path algorithm, Primal-Dual algorithm |
9.7,9.8 |
| |
13 |
Out-of-Kilter algorithm |
9.9 |
| |
18 |
Relaxation algorithm, sensitivity analysis, student
presentations
|
9.10, 9.11 |
| |
20
|
Capacity scaling algorithm, student presentations
|
10.1-10.2 |
| |
25 |
Spanning Tree solutions, student presentations |
11.1-11.3 |
| |
27 |
Computing Node Potentials and Flows, student presentations |
11.4 |
May
|
2 |
Network simplex method |
11.5 |
| |
4 |
Relation to Simplex Method |
11.11 |
|
5
|
Final
Reports due (5 p.m.)
|
|
|
11
|
Final
Exam due (5p.m.)
|
|