UGC-NET | UGC NET CS 2015 Jun – III | Question 32
The travelling salesman problem can be solved in:
Polynomial time using dynamic programming algorithm
Polynomial time using branch-and-bound algorithm
Exponential time using dynamic programming algorithm or branch-and-bound algorithm
Polynomial time using backtracking algorithm
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
Share your thoughts in the comments
Please Login to comment...