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

The Traveling Salesman Problem (TSP) is a prototypical NP-hard combinatorial optimisation challenge: given a set of locations and pairwise distances satisfying the triangle inequality, find the ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...