Travelling Salesman Problem

Edit Answers
12345678910
Across
  1. 2. name for the similar agorithm to this problem.
  2. 6. need to construct a ___ to represent data in matrix.
  3. 7. algorithm to solve TSP by selecting any arbitrary vertex as starting point.
  4. 8. neighbor algorithm is not optimal but ____
  5. 9. of the methods of solving TSP by listing down all halmitonian cycle.
  6. 10. this algorithm,it is important to always choose the ____
Down
  1. 1. cycle must start and end in the same ___.
  2. 3. problem is all about finding the ____ cycle.
  3. 4. force method is not efficient but it is _____.
  4. 5. of the 2 men where this problem is attributed to.