Traveling Salesman Problem

Edit Answers
12345678910
Across
  1. 3. It is a type of vertex that you must always select as your starting point.
  2. 4. One of the rules in NNA is to always take the ___ route.
  3. 7. Nearest ___ Algorithm is not optimal but is efficient.
  4. 8. It is similar to greedy algorithm, except it must be a ___.
  5. 9. There is a ___ involve in solving TSP.
Down
  1. 1. It is a method which lists down all possible Hamiltonian cycle.
  2. 2. He is one the contributors in Traveling Salesman Problem.
  3. 5. He is also one the contributors in Traveling Salesman Problem.
  4. 6. It states that you must construct a ___ to represent the data from matrix.
  5. 10. It states that cycle must start and end in the same vertex.