Please let us know if you have any trouble downloading, displaying, or printing anything on the course web site!
The final exam is scheduled for Dec. 11, 8-10 AM, CST. It will follow the same format as the midterm, with every student taking the exam from home, in real-time. The final exam is cumulative (based on all the material of this class, as covered in the five homeworks).
Please download and print some definitions, theorems, algorithms: linear programming definitions and notes on linear programming duality. We also discussed in class an old assignment on linear versus integer linear programs.
Homework 4 Version 2 is due Nov. 18.
Homework 5 Version 1.1 is due Dec. 2.
The academic honesty handout and the pledge you are asked to sign and return are here.
These MIT lecture notes are the closest to what is happening in class, and can be used instead of a textbook. Please download and print some definitions, theorems, algorithns: graph matching.
Homework 1 is due Sept. 16.
Homework 2 is due Sept. 30. Please download and print some definitions, theorems, algorithns: network flows version 1.1.
Homework 3 is due October 14. Midterm is scheduled for Oct. 19. The topics are Maximum Matching, Maximum Flows, and related properties and applications.