18.453 Combinatorial Optimization

When and where: The class meets Tuesdays and Thursdays from 2:30PM to 4PM in room 2-131.

Instructor: Zarathustra Brady, room 2-350B.

Office hours: Wed 2:30PM-3:30PM in 2-350B.

Prerequisites: Linear algebra. Exposure to discrete mathematics (18.200) is a plus, as well as exposure to algorithms (6.006 and 18.410).

Textbook: There is no required textbook. Lecture notes will be distributed during the term. For additional references, the following textbooks are recommended (roughly in increasing difficulty level or comprehensiveness). The last two are especially recommended to anyone interested in a recent, in-depth coverage of the subject.

For more on matroids, see the book "Matroid Theory" by Welsh or the (different) book "Matroid Theory" by Oxley.

Assignments and grading. There will be roughly bi-weekly problem sets, an in-class quiz on Tue April 9th and a final. There might be additional questions on psets for graduate students. Problem sets are due in class at the beginning of the lecture. The grade will be 30% Psets, 30% quiz and 40% final. Attendance is strongly encouraged. Graduate students and undergraduates may be graded differently. Late policy. Late problem sets will generally not be accepted. For a 10% discount, you can send it up to 24 hours late as a pdf attachment to the lecturer notzeb@mit.edu.

Problem Sets:

Syllabus: (preliminary version)

Handouts: