Open Course Space

Integer Programming and Combinatorial Optimization

Massachusetts Institute of TechnologyUnited States15.083J
Free, no sign-up neededFall 2009English
Go to course on MIT OpenCourseWare

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

Description from MIT OpenCourseWare.

Where to take this course