Go to Main Content

Minerva

 

HELP | EXIT

Detailed Course Catalog Information

 

Fall 2017
Nov 21, 2017
Transparent Image
MATH 552 - Combinatorial Optimization.
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.

Prerequisite: MATH 350 or COMP 362 (or equivalent).
Restriction: Not open to students who have taken or are taking COMP 552.

4.000 Credit hours

Schedule Types: Lecture, Final Exam

Faculty of Science
Mathematics and Statistics Department

Restrictions:
May not be enrolled in one of the following Faculties:     
      Faculty of Dentistry
      Faculty of Medicine
      School of Continuing Studies

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.5.4