ESI6448

Download as PDF

Discrete Optimization Theory

Long Description (Course Description)

Modeling with integer variables; enumeration and cutting plane methods; decomposition algorithms; branch and bound methods; computational complexity and software issues; special combinatorial optimization problems; parallel algorithms for integer programming.

Min Credits

3

Max Credits

3

Repeat for Credit

No

Total Credits Allowed

3

Grading Basis

GRD - Letter Grade