Combinatorics and Optimization

Student writing on board

Combinatorics is the study of discrete structures, and related algorithms. Optimization deals with determining the values of variables that maximize or minimize an objective. At Waterloo, we research and teach in six areas that work together in ways you might not at first expect. A student in quantum computing may use tools from continuous optimization, while effective algorithms for combinatorial optimization can depend on sophisticated ideas from graph theory.

Our research and teaching emphasizes six areas: algebraic combinatorics, combinatorial discrete optimization, cryptography, continuous optimization, graph theory, and quantum computing.

Programs

Icon of graduation capMaster of Mathematics (MMath) in Combinatorics and Optimization

Options: Co-op, Quantum specialization

The MMath degree involves about a year of graduate courses and either a research report or thesis supervised by a faculty member.

Co-op: Students gain valuable experience while earning their degree by spending one or more terms working in industry. Recently, students have chosen co-op as their research focused on financial applications of optimization.

Quantum specialization: The Institute for Quantum Computing offers graduate students unique opportunities to learn about and engage in world-leading research in quantum information.

Icon of bookDoctor of Philosophy (PhD) in Combinatorics and Optimization

Option: Quantum Information specialization

The PhD involves about two years of graduate courses followed by research and a dissertation that typically lasts four years. The quantum specialization is a collaborative program with the Institute for Quantum Computing.

Admission requirements

For more information including admission and degree requirements, select your program of interest below.