Computer Science 308-567B Discrete Optimization
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.
Helpful Material on the Web
Send comments/questions to email@example.com
November 18, 2002