The Traveling Salesman Problem is an optimization problem that consists in finding the minimum path of a tour of n cities, departing from the city of origin or zero node, running the n cities and returning to the point of origin or zero node in the next article a solution for the traveling salesman problem is exposed using an exact heuristic called method MTZ wich will be solved using some of its optimization libraries.