Course Schedule and Catalog

Long Title: INTEGER AND COMBINATORIAL OPTIMIZATION

Department: *Computational & Applied Math*

Grade Mode: Standard Letter

Course Type: Lecture

Credit Hours: 3

Prerequisite(s): CAAM 378 OR CAAM 464 or permission of instructor

Description: Modeling and solving optimization problems with discrete components, graphs and networks; network flow problems; minimum spanning trees; basic polyhedral theory; the knapsack problem; the plant location problem; the set packing problem; computational complexity; branch and bound; cutting planes; Lagrangian relaxation and Bender's decomposition. Cross-list: ECON 475.