动态规划子问题如下:C(S,j)=minC(S−{j},i)+d(i,j)whereiϵSandi≠j <Traveling salesman problem - Cornell University Computational Optimization Open Textbook - Optimization Wiki> <Travelling Salesman Problem (Dynamic Approach) (tutorialspoint.com)>
The solution that is needed to be found for this problem is the shortest possible route in which the salesman visits all the cities and returns to the origin city.If you look at the graph below, considering that the salesman starts from the vertex a, they need to travel through all the ...