Integer and Combinatorial Optimization

Catalog description

Description: Theory, algorithms, and applications of discrete optimization. Binary, pure, and mixed-integer linear optimization formulations, relaxations; preprocessing, branch and bound, formulation strength, polynomial equivalence of separation and optimization; theory of polyhedra, convex hulls and facets, valid inequalities for pure and mixed-integer problems, lifting, perfect formulations, extended formulations. Previously offered as IEM 6023.