ISSN:
1436-4646
Keywords:
Travelling salesman problem
;
probabilistic analysis
;
heuristics
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Let the arc-lengthsL ij of a complete digraph onn vertices be independent uniform [0, 1] random variables. We consider the patching algorithm of Karp and Steele for the travelling salesman problem on such a digraph and give modifications which tighten the expected error. We extend these ideas to thek-person travelling salesman problem and also consider the case where cities can be visited more than once.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01585751
Permalink