18.433 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.310) helpful.
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.
© Copyright 2015 Yasyf Mohamedali