Combinatorial Optimization

Two adjoinging ellipses.

One cycle of the ellipsoid algorithm. (Image by Prof. Santosh Vempala.)

Instructor(s)

MIT Course Number

18.433

As Taught In

Fall 2003

Level

Undergraduate

Translated Versions

繁體字

Cite This Course

Course Features

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.

Santosh Vempala. 18.433 Combinatorial Optimization, Fall 2003. (Massachusetts Institute of Technology: MIT OpenCourseWare), http://ocw.mit.edu (Accessed). License: Creative Commons BY-NC-SA


For more information about using these materials and the Creative Commons license, see our Terms of Use.


Close