18.997 Topics in Combinatorial Optimization

Spring 2004

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

Course Highlights

This course includes a full set of  lecture notes and assignments.

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.
Donate Now

Staff

Instructor:
Prof. Michel Goemans

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Level

Graduate