18.455 Advanced Combinatorial Optimization
Advanced treatment of combinatorial optimization with an emphasis on combinatorial aspects. Non-bipartite matchings, submodular functions, matroid intersection/union, matroid matching, submodular flows, multicommodity flows, packing and connectivity problems, and other recent developments.
This class has 18.453 as a prerequisite.
18.455 will not be offered this semester. It will be available in the Spring semester, and will be instructed by M. X. Goemans.
This class counts for a total of 12 credits. This is a graduate-level class.
You can find more information at the MIT + 18.455 - Google Search site.
© Copyright 2015 Yasyf Mohamedali