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: COMP566 or
MATH 417/487 or COMP/MATH
551 or a course in linear
algebra and
a good knowledge of linear programming (confirm with me please!)
[ SOCS HOME ]