Computer Science COMP-567B 
Discrete Optimization - 2

Winter 2004         Tu-Th 4:05-5:25     Place: McConnell 103

Instructor: Prof. D. Avis

Description: 3 credits; 3 hours; Formulation, solution and applications of integer programs. Branch and bound, cutting plane, and column generation algorithms. Combinatorial optimization. Heuristics. A large emphasis will be placed on modelling. Students will select and present a case study of an application of integer programming in an area of their choice.
Prerequisites: 566A or a course in linear algebra and knowledge of linear programming. 

* Course Outline 
* News
* Helpful Material on the Web 
* Projects   2004          
* Projects   2003          


January 29, 2004