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