15.083J / 6.859 Integer Programming and Combinatorial Optimization, Fall 2004

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.

Bibliographic Details
Main Author: Bertsimas, Dimitris
Other Authors: Sloan School of Management
Format: Learning Object
Language:en-US
Published: 2004
Subjects:
Online Access:http://hdl.handle.net/1721.1/67871