Question

0.3.) Solve the following travelling Salesman problem:
A
B
D
E
B700 8 5 6
6/80
D859
E467
8​

Answer 1

Answer:

Travelling Salesman Problem (TSP): Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible route that visits every city exactly once and returns to the starting point. ... There is no polynomial time know solution for this problem.