Formulations of combinatorial optimization problems, greedy algorithms, dynamic programming, branch-and-bound, cutting plane algorithms, decomposition techniques in integer programming, approximation algorithms. Prereq: (One of CO 250/350 or 352 or 255/355 or CM 340); Not open to General Mathematics students
