Browsing Institute of Engineering Mathematics (Articles) by Subject "Standard Traveling Salesman Problem"
Now showing items 1-1 of 1
-
Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
(AIP Publishing LLC, 2013)The standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is involved. The objective ...