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)
Explanation:
The travelling salesman problem can be solved in exponential time using a dynamic programming algorithm or branch-and-bound algorithm. For more information on the travelling salesman problem and its solution.
Quiz of this Question
Please comment below if you find anything wrong in the above post