Traveling Salesman Problem

12345678910
Across
  1. 3. In the nearest _________, it is always taking the shortest route
  2. 4. _______ a graph to represent the data from matrix
  3. 7. cycle must start and end in the ______ vertex
  4. 8. TSP is attributed to sir ______ Hamilton
  5. 9. Computing for least time by _____ the numbers assigned to the edge
  6. 10. similar to ________ algorithm except it must be a cycle
Down
  1. 1. in the brute-force method we must list down all possible ______ cycle
  2. 2. "always choose the _______ route"
  3. 5. Determine the least time ___________
  4. 6. TSP is about _______ the shortest hamilonian cycle