IMSE 884 - Integer Programming and Combinatorial Optimization

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.

Credits: (3)

Note:
Three hours lecture a week.

Requisites:
Pr.: IMSE 660.

When Offered:
Spring, even years