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

Many important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem ...

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

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem. When Nathan Klein started graduate school two years ago, his ...

Researchers demonstrated a quantum algorithmic speedup with the quantum approximate optimization algorithm, laying the groundwork for advancements in telecommunications, financial modeling, materials ...