15.083J / 6.859 Integer Programming and Combinatorial Optimization, Fall 2004
Integer Programming and Combinatorial Optimization
MetadataShow full item record
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.
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
Showing items related by title, author, creator and subject.
Optimizing over coherent risk measures and non-convexities: a robust mixed integer optimization approach Takeda, Akiko; Bertsimas, Dimitris J. (Springer US, 2015-05)Recently, coherent risk measure minimization was formulated as robust optimization and the correspondence between coherent risk measures and uncertainty sets of robust optimization was investigated. We study minimizing ...