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.
Course Info
Learning Resource Types
notes
Lecture Notes
assignment
Problem Sets
![Two adjoinging ellipses.](/courses/18-433-combinatorial-optimization-fall-2003/a57c259876d3e754c4931bef5590d242_18-433f03.jpg)
One cycle of the ellipsoid algorithm. (Image by Prof. Santosh Vempala.)