All Questions
Tagged with hamiltonian-paths traveling-salesman-problem
3 questions
2
votes
1
answer
133
views
Constructing optimal Hamilton cycles from optimal Hamilton paths
Question:
can the shortest Hamilton cycle in a complete symmetric graph with weighted edges be constructed from the shortest Hamilton path in the same graph by connecting its ends and then exchanging ...
- 4,219
0
votes
1
answer
117
views
Traveling salesperson problem algorithm [closed]
I was wondering something, let's say in a symmetric distance matrix of a sample of TSP, there was a sure algorithm that could remove between 30% to 80% of the values (distances) that wouldn't ...
- 5,429
1
vote
1
answer
347
views
Algorithm for multiple travelling salesmen problem with given starting point and end point
Given:
Set of n>0 cities is to be traversed by m>0 salespeople
Where all the salespeople:
Are positioned at the same starting city;
Finish at a same destination (which different from starting ...
- 11