Practical application of The Traveling Salesman problem

The Traveling Salesman problem (TSP) is one of the best known problems in combinatorial optimization. In this work I put mind to history and interest at first. In second part I mention economical and mathematical model with some theoretical methods of solving TSP. In third part I apply these methods to a concrete example. At the end I confront all used methods