IE 611 - Integer Programming

3 Credit Hours

Theoretical foundations of Integer Programming and its application to optimization problems, including branch-and-bound, cutting planes, polyhedral analysis, and complexity.
(DE) Prerequisite(s): 516, 518, and 522.
Recommended Background: Linear Programming.
Registration Permission: Minimum student level – graduate.

Add to Portfolio.

Close Window