COMP 552 Combinatorial Optimization

4 credits · Computer Science · Faculty of Science · Not scheduled for 2026–2027

Algorithmic and structural approaches in combinatorial optimization with a focus upon theory and applications. Topics include: polyhedral methods, network optimization, the ellipsoid method, graph algorithms, matroid theory and submodular functions.

Prerequisites

Math 350 or COMP 362 (or equivalent).

Prerequisite courses: COMP 362, MATH 350

Restrictions

This course is reserved for undergraduate honours students and graduate students. Not open to students who have taken or are taking MATH 552.

Plan your whole degree in myDegree. Fit COMP 552 and everything it needs into a plan, term by term. Open myDegree

Source: McGill Course Catalogue. myDegree is an independent student project, not affiliated with McGill University.