|
Home
| Subject Search
| Help
| Symbols Help
| Pre-Reg Help
| Final Exam Schedule
| My Selections
|
Searched for: "15.083" Subjects offered any term 1 subject found.
15.083 Integer Programming and Combinatorial Optimization
(
)
Prereq: 15.081J or permission of instructor
Units: 4-0-8
Lecture: MW10-11.30 (E51-361) Recitation: F3 (E51-390)
In-depth treatment of the modern theory of integer programming and combinatorial optimization, emphasizing geometry, duality, and algorithms. Topics include formulating problems in integer variables, enhancement of formulations, ideal formulations, integer programming duality, linear and semidefinite relaxations, lattices and their applications, the geometry of integer programming, primal methods, cutting plane methods, connections with algebraic geometry, computational complexity, approximation algorithms, heuristic and enumerative algorithms, mixed integer programming and solutions of large-scale problems.
J. Vielma Centeno
No textbook information available
| ||||||||
