Skip to content


prof. Vašek Chvátal
The Traveling Salesman Problem
On 2015-11-26 16:00 at KN:E-107
The traveling salesman problem is one of the most intensively studied problems
in computational mathematics. It is easy to state: given a finite number of
cities and the cost of travel between each pair of them, find the cheapest way
of visiting them all and returning to your starting point.

It is notoriously hard to solve. The lecture will comprise a survey of the
history of the problem as well as techniques and tricks used in its solution.
Back to the list