Slides

If you wish to view the MS journal files, you can download the following viewer. Alternatively, you can view the PDF files.

1. Oct. 22 What is linear programming? PDF version
2. Oct. 26 Introduction to network flow. PDF version
3. Oct. 29 Min Cut = Max Flow, Ford & Fulkerson, Applications of max flow (matching and vertex cover in bipartite graphs, introduction to push-relabel algorithm. PDF version
4. Nov. 2 The push-relabel algorithm. PDF version
5. Nov. 9 Flow with lower bounds. PDF version
6. Nov. 12 Push Relabel algorithm. PDF version
7. Nov. 17 Global min cut. PDF version
8. Nov. 23 Min cost flow. PDF version
9. Nov. 26 Minimum cycle mean. PDF version
10. Nov. 30 Min cost flow: cancelation of cycles with minimum mean cost. PDF version
11. Dec. 7 Maximum cardinality matching. PDF version
12. Dec. 14 Introduction to linear programming. PDF version
13. Dec. 21 Polyhedrons. PDF version
14. Dec. 4 Farkas Lemma & Strong Duality. PDF version
15. Jan. 7 Duality. PDF version
16. Jan. 18 Primal Dual algorithm for Set Cover. PDF version