IE 511
IE 511 - Integer Programming
Spring 2024
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Integer Programming | IE511 | L | 34285 | LCD | 4 | 0930 - 1050 | T R | 206 Transportation Building | Yatharth Dubey |
See full schedule from Course Explorer
Official Description
Optimization of linear systems over discrete decision domains. Topics to be covered include Modeling, Polyhedral theory, Integral Polyhedra, Totally Unimodular Matrices, Total Dual Integrality, Computational Complexity, Cutting plane method, Branch and Bound method, and Lagrangian Dual. Structured integer programs involving Matchings, Knapsack, Cuts and Matroids will be studied as applications. Course Information: 4 graduate hours. No professional credit. Prerequisite: IE 411 or MATH 482.