Topics in Combinatorial Optimization

Illustration of the proof of Petersen's theorem.

Illustration of the proof of Petersen's theorem. (Image courtesy of Dan Stratila.)

Instructor(s)

MIT Course Number

18.997

As Taught In

Spring 2004

Level

Graduate

Cite This Course

Course Features

Course Description

In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with non-bipartite matchings and cover many results extending the fundamental results of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial results, including min-max relations, and not so much on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms.

Goemans, Michel. 18.997 Topics in Combinatorial Optimization, Spring 2004. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/mathematics/18-997-topics-in-combinatorial-optimization-spring-2004 (Accessed). License: Creative Commons BY-NC-SA


For more information about using these materials and the Creative Commons license, see our Terms of Use.


Close