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

Combinatorial optimisation is a fundamental field in applied mathematics and computer science that focuses on finding an optimal object from a finite set of objects. In this context, problems are ...