MA252 Schedule
Term 2


The following is an outline of the course, which will be updated as the course progresses. Guides to the topic we will cover in any given week are only approximate.


Week (date of Monday) Topics Sections Homework Event
1 6/1 Algorithms One nice reference is Lecture 0 of Jeff Erickson's algorithm's class HW 1
2 13/1 Spanning trees Cook et al Chapter 2
3 20/1 Shortest paths Cook et al Chapter 2
See also this handout. 		HW 2 HW 1 due Tuesday
4 27/1 Max-flow Cook et al Chapter 3 HW2 due Thursday
5 3/2 Matchings HW 3  
6 10/2 Linear programming Bertsimas and Tsitsiklis. 2.1, 1.1 HW3 due Thursday
7 17/2 Linear programming Bertsimas and Tsitsiklis. 2.2, 2.3,2.5, 2.6 HW 4
8 24/2 More linear programming Bertsimas and Tsitsiklis. 2.4, 3.1, 3.2 HW4 due Thursday
9 3/3 More linear programming Bertsimas and Tsitsiklis. 3.3, 3.4, 3.5 HW 5
10 10/3 Linear programming duality. Summary Bertsimas and Tsitsiklis. 4.1, 4.2 HW 6 (non-assessed - may be updated later) HW5 due Thursday