18.433 -- Combinatorial Optimization
Course Description: Thorough treatment of linear programming and combinatorial optimization. Topics include matching theory, network flow, matroid optimization, and how to deal with NP-hard optimization problems. Prior exposure to discrete mathematics (such as 18.310) helpful.

This class is at the Undergraduate level
Instructor: P. W. Shor
Open Courseware Website
Prerequisites: 18.06 or 18.700

Back to Classes