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.
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 or on the 18.453 Stellar site.
© Copyright 2015 Yasyf Mohamedali