Spring 2012 Course Descriptions
COMP 150-02 Combinatorial Optimization
Methods for solving discrete optimization problems: Linear and convex programming, duality, max flow, bipartite matching, branch and bound, approximation.
Text: Combinatorial Optimization, by Papadimitriou and Steiglitz, Dover, 1998
Prerequisite: Linear Algebra (MATH 46 or 54) and Algorithms (COMP 160)