| Date | Topic | Reading |
| Session 1 1/22/14 |
Course Overview Introduction to Network Flow Models |
Ahuja, Magnanti, and Orlin (AMO): Chapter 1 |
| Session 2 1/29/14 |
Solving Network Flow Models with AMPL Algorithm Design and Analysis |
AMPL
Book by Fourer, Gay, and Kernighan AMO: Sections 2.3, 3.1, and 3.2 (through page 63) |
| Session 3 2/5/14 |
Network Representations Fundamental Network Algorithms |
AMO: Section 2.4 AMO: Section 3.4 |
| Session 4 2/12/14 |
Shortest Path Applications Algorithms for the Shortest Path Problem: Introduction Shortest Path Trees |
AMO Sections: 4.1, 4.2, 4.3, and 4.4 |
| Session 5 2/19/14 |
Dijkstra's Algorithm The Bellman-Ford Algorithm MCNFP and Negative Cycles The Floyd-Warshall Algorithm |
AMO: Section 4.5 AMO: Sections 5.1, 5.2, 5.3, 5.4, 5.5, and 5.6 |
| Session 6 2/26/14 |
Summary of Shortest Path Algorithms Fixed-Charge Network Flow Models Generalized Network Flow Models |
AMO: Sections 15.1 and 15.2 |
| Session 7 3/5/14 |
Interval-Flow Network Flow Models | |
| 3/12/14 | Spring Break | |
| Session 8 3/19/14 |
Midterm Exam | |
| Session 9 3/26/14 |
The Maximum Flow Problem Flows and Cuts The Max-Flow Min-Cut Theorem The Augmenting Path Algorithm The Ford-Fulkerson Algorithm Flows on Cycles Max Flow with Positive Lower Bounds |
AMO: Sections 6.1 - 6.5 |
| Session 10 4/2/14 |
Applications of the Max-Flow/Min-Cut Theorem | AMO Sections 8.1, 8.6, and 8.7 |
| Session 11 4/9/14 |
Optimal Trees | AMO Sections 13.1 - 13.5 |
| Session 12 4/16/14 |
Review of the Simplex Method | AMO Appendix C |
| Session 13 4/23/14 |
The Network Simplex Algorithm | AMO Sections 11.1 - 11.5, 11.2 |
| Session 14 4/30/14 |
Multicommodity Flows | AMO Sections 17.1 and 17.2 |
| 5/7/14 | Final Exam |