Combinatorial Optimization
McGill University · QC · COMP552
Combinatorial Optimization is a subject at McGill University, QC in COMP. It covers topics like algorithms, computational-biology, computational-mathematics, operations-management. It is part of 2 degrees. The information below is compiled from public course material — approximate, not official.
McGill University
COMP552
3.00
COMP
Topics covered
Degrees that include Combinatorial Optimization
- Computer Science (Thesis) (M.Sc.) (45 credits)
- Statistics and Computer Science Honours (B.Sc.) (79 credits)
Frequently asked questions
What is Combinatorial Optimization about?
Combinatorial Optimization covers topics like algorithms, computational-biology, computational-mathematics, operations-management.
Which degrees include Combinatorial Optimization?
Combinatorial Optimization is part of 2 degrees, including Computer Science (Thesis) (M.Sc.) (45 credits), Statistics and Computer Science Honours (B.Sc.) (79 credits).
How many credit points is Combinatorial Optimization?
Combinatorial Optimization at McGill University is typically around 3.00 credit points. Approximate — confirm with the university.
Where is Combinatorial Optimization taught?
Combinatorial Optimization is taught at McGill University, QC.
Studying Combinatorial Optimization?
Peernovo helps students research, choose and thrive at university — across Australia, the US, the UK and Canada — powered by our AI backbone:
- Explore & compare degrees — across universities and countries with honest, specific information.
- "What Can I Be?" career guidance — an AI pathway councillor that maps degrees to careers.
- See who's studying — your degree at your university — find classmates and study groups.
- AI Task Coach — a Socratic study companion that plans your work around your life.
- Honours & Thesis Research Coach — structure and move your research project forward.
- Smart study planner, exam prep and a daily digest — to keep you on track.
Sources: McGill University public course catalogue. Information is compiled and summarised — not copied verbatim — and is approximate; always confirm with the original source.
Something not right on this page, or want it changed? Let us know and we'll review it.