MIT OpenCourseWare
  • OCW home
  • Course List
  • about OCW
  • Help
  • Feedback
  • Support MIT OCW

18.433 Combinatorial Optimization, Fall 2003

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

Highlights of this Course

This course includes a full set of lecture notes, plus problems sets.

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.
 

Staff

Instructor:
Prof. Santosh Vempala

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Level

Undergraduate

Feedback

Send feedback about OCW or this course.