18.433 Combinatorial Optimization

When and where: The class meets on Tuesdays and Thursdays from 11AM to 12:30PM in room 4-149.

Instructor: Michel Goemans, room 2-351. Office hours: Wed 2:45PM-3:45PM.

This page: http://math.mit.edu/~goemans/18433S13/18433.html

Quiz: There will be an in-class quiz on Thursday April 11th. Here is a sample quiz from a previous year (given just for your information).

Prerequisites: Linear algebra. Exposure to discrete mathematics (18.310) is a plus, as well as exposure to algorithms (6.006 and/or 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.

Syllabus: (preliminary version)

Assignments and grading. There will be roughly bi-weekly problem sets, an in-class quiz scheduled for Thursday April 11 and a final during final week. 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. Still, for a good reason, an arrangement can be made provided you discuss it with the instructor at least 48 hours prior to the deadline.



Course notes:

Course notes from earlier terms that will be slightly updated: