The Long Road: Comparison of Approximation Heuristics for Traveling Salesperson Problem

In the theory of computational complexity, the traveling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research.

The PDFs of our paper and posters could be downloaded by clicking on the images below!