CMOR 543

COMBINATORIAL OPTIMIZATION

Credit Hours: 3 · Graduate

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.

Prerequisites & course information

Short Title: COMBINATORIAL OPTIMIZATION Department: Comp Appl Math Operations Rsch Grade Mode: Standard Letter Course Type: Lecture Credit Hours: 3 Restrictions: Enrollment is limited to Graduate level students. Course Level: Graduate

Sources

Course catalogue ↗2026–2027