> I have problems on the "open path" traveling salesman problem. > That is, given a starting point s, an end point d, accompained with n > points, to find the shortest path from s to d and all the n cities > (just once). > > > Is this a variation of TSP ?
The hamiltonian path problem is similar but it does not specify the end point d. Specifying the end point might not make the problem harder (or easier) but the solution to an instance may be different. Strategies for solving TSP can be easily applied to your variant. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
