Register

Recent questions tagged travelling-salesman-problem

1 votes
1 answer
1
algorithm
travelling salesman problem is based on a) dynamic programming b)greedy method c)recursive approach d)divide and conquer
travelling salesman problem is based ona) dynamic programmingb)greedy methodc)recursive approachd)divide and conquer
User Avatar
0 votes
1 answer
2
Travelling Salesman problem considering the triangle inequality
Travelling Salesman problem considering the triangle inequality ,tell the procedure of finding the approximate solution in polynomial time using a suitable example.
Travelling Salesman problem considering the triangle inequality ,tell the procedure of finding the approximate solution in polynomial time using a suitable example.
User Avatar
1 votes
1 answer
3
Find the shortest tour for given graph using greedy approach
... directed graph as forward /backward distances are not same. But how to solve using Greedy Approach using TravelSalesman Problem(TSP) ?
$\begin{bmatrix} 0& 29& 19& 25& 22\\ 20& 0& 21& 23& 21\\ 19& 21& 0& 21& 20\\ 25& 23& 21& 0& 32\\ 22& 21& 20& 22& 0 \end{bmatrix}$Find the shortest tour for given graph us...
User Avatar
To see more, click for the full list of questions or popular tags.