Dec 09, 2025  
2025-2026 Graduate Catalog 
    
2025-2026 Graduate Catalog
Add to Portfolio (opens a new window)

IMSE 884 - Integer Programming and Combinatorial Optimization

Credits 3

Solution techniques to optimization problems invloving integer variables. The topics covered include: single-and multiple-branching, implicit enumeration, polyhedral theory and cutting planes, mixed integer programs, unimodular matrices and matroids.

Note
Three hours lecture a week.

Repeat for Credit
Y

Requisites
Prerequisite: IMSE 660.

Typically Offered
Spring-Odd Years



Add to Portfolio (opens a new window)