No self-introduction
Loading
Profile
Follow
codes (1)
Traveling salesman problem classical solution
no vote
Traveling salesman problem (TSP) is a problem in which a traveling agent has to travel to several cities, and the cost between the cities is known. In order to save the cost, the traveling agent decides to start from the city where he is, travel to each city once, and then return to the original city, and asks him what kind of route he should choose to minimize the total cost? This problem can be described as follows: Let G = (V, e) be a digraph with edge cost CIJ
Beachfish 0 0
1
No more~
Follows0
Fans0