CO 353 Computational Discrete OptimizationCombinatorics and Optimization (2009-2010)
Formulations of combinatorial optimization problems, greedy algorithms, dynamic programming, branch-and-bound, cutting plane algorithms, decomposition techniques in integer programming, approximation algorithms. [Offered: F]
Prerequisites: (CO 350 and MATH 239 or 249) or CO 352/CM 340; Not open to General Mathematics students
Notes: (Cross-listed with CM 441)
Sections For Fall 2009
CO 353 is not held in Fall 2009
Sections For Spring 2009
CO 353 is not held in Spring 2009