The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

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

Metric spaces form the backbone of modern computational geometry by providing a rigorous framework for measuring distances within abstract sets, while geometric approximation algorithms yield ...

Shortest path algorithms like Dijkstra, BFS, and advanced approximations power everything from Google Maps to network routing. Understanding when and how to apply them can save time and resources in ...

The stochastic root-finding problem is that of finding a zero of a vector-valued function known only through a stochastic simulation. The simulation-optimization problem is that of locating a ...