Course Schedule and Catalog

Long Title: 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: General theory and approaches for solving combinatorial optimization problems are studied. Specific topics include basic polyhedral theory, minimum spanning tress, shortest paths, network flow, matching and matroids. The course also cover the traveling salesman problem.