18.433 | Fall 2003 | Undergraduate
Combinatorial Optimization
Course Description
Combinatorial Optimization provides a thorough treatment of linear programming and combinatorial optimization. Topics include network flow, matching theory, matroid optimization, and approximation algorithms for NP-hard problems.
Learning Resource Types
notes Lecture Notes
assignment Problem Sets
Two adjoinging ellipses.
One cycle of the ellipsoid algorithm. (Image by Prof. Santosh Vempala.)