Description: Traveling salesman problem can be described as: the salesman intends to start the station to visit each city he wants to go, and each city can only visit once, and finally must return to the starting city. Ask how to arrange his visit to these cities order, can make the total length of the travel route is the shortest? In terms of graph theory, the traveling salesman problem is to find a weighted complete graph on the smallest Hamilotn circle [4].
To Search:
File list (Check if you may need any files):
sa.m
A.txt
Download