The travelling salesman problem can be solved in:
A. Polynomial time using dynamic programming algorithm
B. Polynomial time using branch-and-bound algorithm
C. Exponential time using dynamic programming algorithm or branch-and-bound algorithm.
D. Polynomial time using backtracking algorithm.
Answer:C
The travelling salesman problem can be solved in:
A. Polynomial time using dynamic programming algorithm B. Polynomial time using branch-and-bound algorithm C. Exponential time using dynamic programming algorithm or branch-and-bound algorithm. D. Polynomial time using backtracking algorithm.