CO 454 SchedulingCombinatorics and Optimization (2009-2010)
An overview of practical optimization problems that can be posed as scheduling problems. Characterizations of optimal schedules. Simple and efficient combinatorial algorithms for easy problems. A brief overview of computational complexity, definition of P, NP, NP-Complete and NP-hard. Integer programming formulations, the Traveling Salesman Problem, heuristics, dynamic programming and branch-and-bound approaches. Polynomial-time approximation algorithms. [Offered: S]
Prerequisites: (MATH 239 or 249 and either CO 350 or CO 352/CM 340) or CO 355; Not open to General Mathematics students
Sections For Fall 2009
CO 454 is not held in Fall 2009
Sections For Spring 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Chakrabarty, Deeparnab | 11:30-12:50 M T W Th F | 22/45 | 1 | 1 | MC 4060 | 3140 | ||