Browsing Computer Science by Author "Emami Taba, Mahsa Sadat"
Now showing items 1-1 of 1
-
Solving Traveling Salesman Problem With a non-complete Graph
Emami Taba, Mahsa Sadat (University of Waterloo, 2010-01-07)One of the simplest, but still NP-hard, routing problems is the Traveling Salesman Problem (TSP). In the TSP, one is given a set of cities and a way of measuring the distance between cities. One has to find the shortest ...