Mar 29, 2024  
2019-2020 Graduate Catalog 
    
2019-2020 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:
Prerequisite: IMSE 660.

Typically Offered
Spring, even years


KSIS Course Search




Add to Portfolio (opens a new window)