Estratégias de modelagem para o Problema do Caixeiro Viajante utilizando o software CPLEX

In this work two mathematical models for the Traveling Salesman Problem (TSP) were implemented using the modeling language of CPLEX software, with the aim to compare computational performance of both models. Computational tests were conducted to compare two differentmethodologies for the modeling of combinatorial optimization problems. On one side, one model is generated in a static way, with all its restrictions, on the other side, the other model is generated in a dynamic way, by the addition of restrictions as needed. Tests showed that the second approach offer significant computational gains