BoutainaELYAZIJI/TSP_project

The traveling salesman problem (TSP) is a well-known problem in theoretical computer science and operations research. The standard version of the TSP is a hard problem and belongs to the NP-Hard class. In this project, I build an application to implement the TSP by the dynamic approach and the GVNS approach .