Sept 9. Course Introduction; Matching Theory.
Sept 14. The Hungarian algorithm.
Sept 16. Edmonds' algorithm. Notes for Lectures 1-3.
Sept 21. Polyhedral combinatorics. Notes.
Sept 23. The matching polytope I. Notes.
Sept 28. The matching polytope II. Notes.
Assignment 1.

Sept 30. Flow Theory and duality.
Oct 5. Max-flow algorithms. Notes for Lectures 7-8.
Oct 7. Min-cut algorithms. Notes.
Oct 12, 14. Min-cost flow. Notes.
Assignment 2.

Oct 19. Linear Programming duality. Notes.
Oct 21. Exam I.
Oct 26. The Simplex algorithm.
Oct 28. Simplex (contd.). Notes for strong duality and Simplex.
Nov 2. Complementary slackness, Primal-dual algorithm. Notes.
Assignment 3 .

Nov 4. The Ellipsoid algorithm I: Ideas.
Nov 9. II: Details. Notes.
Nov 11. Holiday.
Nov 16. Separation Oracles I: Convex problems.
Nov 18. Oracles II: Combinatorial problems. Notes.
Nov 23. NP-hardness and Approximation algorithms.
Assignment 4 (Due: Dec 2).

Nov 25. Holiday.
Nov 30. The relax-and-round paradigm. Notes.
Dec 2. Exam II.
Dec 7. Projects reviews.