18.453 Combinatorial Optimization
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.
18.453 will not be offered this semester. It will be available in the Spring semester, and will be instructed by M. X. Goemans.
Lecture occurs 1:00 PM to 2:30 PM on Tuesdays and Thursdays in 4-237.
This class counts for a total of 12 credits.
You can find more information at the http://www.google.com/search?&q=MIT+%2B+18.453&btnG=Google+Search&inurl=https site.
© Copyright 2015 Yasyf Mohamedali