Course Schedule and Catalog

Long Title: COMBINATORIAL OPTIMIZATION

Department: *Computational & Applied Math*

Grade Mode: Standard Letter

Course Type: Lecture

Credit Hours: 3

Description: General theory and approaches for solving combinatorial optimization problems are studied. Specific topics include basic polyhedral theory, minimum spanning trees, shortest paths, network flow, matching and matroids. The course also covers the traveling salesman problem. Recommended Prerequisite(s): CAAM 378 OR CAAM 471.