Integer programming, a cornerstone of combinatorial optimisation, focuses on the selection of discrete decision variables to solve complex real‐world problems such as scheduling, network design and ...

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 ...

This course examines formulation and solution of applicable optimization models, including linear, integer, nonlinear, and network problems, efficient algorithm methods, and use of computer modeling ...

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 ...

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 ...