0 votes 0 votes 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 back tracking algorithm Algorithms algorithms p-np-npc-nph ugcnetcse-june2015-paper3 + – Shubham Sahu asked Jul 12, 2015 Shubham Sahu 5.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes As per i know travelling salesman problem is a Np hard not p . if the traveling salesman problem can be solved in polynomial time using backtracking then it will become a P . So its false , it cant be solved in polynomial time by deterministic way . Pranay Datta 1 answered Jul 12, 2015 Pranay Datta 1 comment Share Follow See 1 comment See all 1 1 comment reply yuviabhi commented Jun 14, 2019 reply Follow Share Option C 0 votes 0 votes Please log in or register to add a comment.