Introduction to combinatorial optimization covering exact and approximation algorithms for discrete structures.
Offering recorded · Fall 2026
Reviewers describe the workload as heavy, with time-consuming homework and brutal exams. The course requires deep knowledge of in-depth proofs, making it challenging for non-elite math majors.
Introduces linear optimization problems, emphasizing formal proofs, the simplex method, duality theory, and theorems of the alternatives.
Offering recorded · Fall 2026
The course is considered very difficult, with hard assignments that require significant study time, though group work is permitted. Exams are reported as easier than homework, although one student found the final exam unexpectedly difficult despite its stated format.