18.433 Combinatorial Optimization


Class Info

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 has 18.06, 18.700, and 18.701 as prerequisites.

18.433 will not be offered this semester. It will be instructed by M. X. Goemans.

Lecture occurs 1:00 PM to 2:30 PM on Mondays and Wednesdays in E17-133.

This class counts for a total of 12 credits. This is a graduate-level class.

In the Spring 2015 Subject Evaluations, 18.433 was rated 5.8 out of 7.0. You can find more information at the 18.433 Combinatorial Optimization site.

MIT 18.433 Combinatorial Optimization Related Textbooks
MIT 18.433 Combinatorial Optimization On The Web
18.433 Combinatorial Optimization
Tags
combinatorics matroids quiz combinatorial optimization k. steiglitz berlin heidelberg new york a. schrijver

© Copyright 2015