15.083J / 6.859 Integer Programming and Combinatorial Optimization, Fall 2004
Name
15-083j-fall-2004/contents/index.htm
Size
15.99 KB
Format
HTML
Checksum (MD5)
4f6f15c71b5a9c4ce063c96e58671c63
Author(s)
Bertsimas, Dimitris
Alternative Title
Integer Programming and Combinatorial Optimization
Date Issued
December 2004
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.
Subjects
theory
algorithms
integer optimization
formulations and relaxations
algebra and geometry of integer optimization
algorithms for integer optimization
extensions of integer optimization
15.083J
6.859
15.083
MIT Department
Sloan School of Management
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Persistent DSpace Link
