Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

The field of mixed integer programming addresses optimisation problems characterised by both continuous and discrete decision variables subject to linear constraints. Traditional exact methods, ...

Methods for NP-hard discrete optimization problems, including general methods like branch-and-bound and cutting planes, as well as special purpose branch-and-cut methods. Students will be able to ...