Combinatorial optimisation problems arise in many fields, from logistics and network design to machine learning and bioinformatics. Most classical formulations are NP-hard, rendering exact ...

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 studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Correlation clustering is a framework for partitioning the nodes of a graph according to pairwise similarity and dissimilarity labels on edges. Rather than fixing the number of clusters in advance, ...