Teaching
Courses (to be) taught:
 Spring '17: 18.453 Combinatorial Optimization
 Fall '16:
 Spring '16: 18.200A (was 18.310A) Principles of Discrete Applied mathematics
 Spring '15:
 Spring '14: 18.438 Advanced Combinatorial Optimization.
 Fall '13: 18.310 Principles of Discrete Applied Mathematics
 Spring '13:18.433 Combinatorial Optimization
 Fall '12: 18.310 Principles of Applied Mathematics
 Spring '12: 18.438 Advanced Combinatorial Optimization.
 Fall '11: 18.434 Seminar in Theoretical Computer Science
 Spring '11: 18.433 Combinatorial Optimization
 Fall '10: 18.310 Principles of Discrete Applied Mathematics
 Spring '10:
 Fall '09: 18.438 Advanced Combinatorial Optimization.
 Spring '09: 18.433 Combinatorial Optimization
 Fall '08: 18.415 Advanced Algorithms. On OCW.
 Spring '07: 18.433 Combinatorial Optimization
 Fall '06: 18.409 Topics in Theoretical Computer Science: Metric Embeddings.
 Spring '06: 18.434 Undergraduate Seminar in Theoretical Computer Science.
 Fall '05: 18.433 Combinatorial Optimization.
 Fall '04: 18.06 Linear Algebra.
 Spring '04: 18.997: Topics in Combinatorial Optimization. See archive on the OCW site.
 Fall '03: 18.06 Linear Algebra.

Spring '03:
 18.997: Graduate course on polytopes.
 Recitation for 18.02.

Spring '02:
 18.410J/6.046J Introduction to Algorithms
 Recitations in 18.06 Linear Algebra.
 Fall '01: 18.415J/6.854J Advanced Algorithms. On OCW archive. Old webpage.
Course notes:
Here are scribe notes from Topics in Combinatorial Optimization (Spring 2004), as archived by OCW.Most of my old course notes (on linear programming, approximation algorithms, network flows, etc.) from Advanced Algorithms (18.415J/6.854J) are available here at the OCW site. These (very old) notes are based on scribed notes by students. Additional notes, not given there, cover online algorithms, randomized algorithms, and Karp's partitioning scheme.
site info
© 2009 Michel Goemans  Original design by Andreas Viklund