algorithm

Question

travelling salesman problem is based on

a) dynamic programming

b)greedy method

c)recursive approach

d)divide and conquer

Answer 1

a) dynamic programming

Travelling Salesman Problem (TSP): Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible route that visits every city exactly once and returns to the starting point.

in TSP we are covering every possiblity so dynamic programming.