In the dynamic traveling salesman problem (TSP), the vertices and/or weights of the graph that represents the TSP are changed during the optimization process. The dynamic TSP with weight changes is ...

We study a new variation of the Traveling Salesman Problem (TSP) called the Budget-Constrained Traveling Salesman Problem (BC-TSP). BC-TSP is inspired by a few emerging network applications, such as ...