18.453 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.200) helpful.

This class has 18.06, 18.700, and 18.701 as prerequisites.

18.453 will be offered this semester (Spring 2019). It is instructed by Z. Brady.

Lecture occurs 2:30 PM to 4:00 PM on Tuesdays and Thursdays in 2-131.

This class counts for a total of 12 credits.

You can find more information at the MIT + 18.453 - Google Search site.

MIT 18.453 Combinatorial Optimization Related Textbooks
MIT 18.453 Combinatorial Optimization On The Web

© Copyright 2015