Course
Outline
News
Lecture
notes and summaries
Case study information Projects
2007
Projects
2003 Instructor: Prof. David Avis
Description: 3 credits; 3 hours; Formulation, solution
and applications of integer programs. Branch and bound, cutting plane,
and
column generation algorithms. Combinatorial optimization. Stochastic
Optimization. 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: 566 or a course in linear algebra,
a good knowledge of linear programming, and permission of the
instructor..
Course
Outline
News
Lecture
notes and summaries
Case study information Projects
2007
Projects
2003 Projects
2004
[ SOCS HOME ]