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.
![Integer Programming and Combinatorial Optimization | Sloan School of Management | MIT OpenCourseWare](https://cdn-ak-scissors.b.st-hatena.com/image/square/ce5945313c57fd577dbd6597ac27e1c6398e8dca/height=288;version=1;width=512/https%3A%2F%2Focw.mit.edu%2Fcourses%2F15-083j-integer-programming-and-combinatorial-optimization-fall-2009%2F7e9b1cf3cf6ee9e6dbf50f48bb1a45c1_15-083jf09.jpg)