| Week | Topic | Reading | Homework |
|---|---|---|---|
| March 25 - 29 | Introduction, Graph Theory, TSP Notes: 03/25, 03/27, 03/29 | 1.1, 1.2, 1.3 TSP | HW 1 due April 4 (.tex, .pdf) |
| April 1 - 5 | Minimum spanning trees, shortest paths Notes: 04/01, 04/03, 04/05 | 2.1, 3.1 | HW 2 due April 11 (.tex, .pdf) |
| April 8 - 12 | Shortest paths Notes: 04/08, 04/10, 04/12 | 3.1, 3.2, 3.3,
4 recent progress | HW 3 due April 18 (.tex, .pdf) | April 15 - 19 | Networks Flows, MinCut Notes: 04/15, 04/17, 04/19 | 4.1, 4.2, 4.3 | HW 4 due April 25 (.tex, .pdf) |
| April 22 - 26 | Bipartite Matchings, Linear Programmingt Notes: 04/22 | 4.4, 5 | Midterm May 1 |
| April 29 - May 3 | Linear Programming | 5.1, 5.4 | HW 5 due May 9 |
| May 6 - 10 | Total unimodularity | 5.3, 5.4, 6.1 | HW 6 due May 16 |
| May 13 - 17 | Applications, Branch and Bound | 6.2, 6.3, 7 | HW 7 due May 23 |
| May 20 - 24 | Non-bipartite matchings | 8.1, 8.2, 8.3 | HW 8 due May 31 |
| May 29 - 31 No class May 27 | Knapsack problems, review | 9.1, 9.2 | |
| June 4 | Final Exam |