Remix and Share
Integer Programming and Combinatorial Optimization, Fall 2009
(Complete Item Description)
- Abstract:
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.
- Subject:
- Mathematics and Statistics, Science and Technology
- Grade Level:
- Post-secondary
- Collection:
- MIT OpenCourseWare
