UGC-NET | UGC NET CS 2015 Jun – III | Question 32

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 dynamic programming algorithm or branch-and-bound algorithm.
For more information on travelling salesman problem and its solution Refer:Travelling Salesman Problem
So, option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.