Dec 05, 2025  
2008-2009 Graduate Catalog 
    
2008-2009 Graduate Catalog [ARCHIVED 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.

Requisites
Pr.: IMSE 660.

When Offered
II, in even years



Add to Portfolio (opens a new window)