An improved lower bound for the Traveling Salesman constant
Author(s)
Gaudio, Julia; Jaillet, Patrick![Thumbnail](/bitstream/handle/1721.1/129336/1907.02390.pdf.jpg?sequence=4&isAllowed=y)
DownloadSubmitted version (125.4Kb)
Publisher with Creative Commons License
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
Let X1,X2,…,Xn be independent uniform random variables on [0,1]2. Let L(X1,…,Xn) be the length of the shortest Traveling Salesman tour through these points. Beardwood et al (1959) showed that there exists a constant β such that [Formula presented] almost surely. It was shown that β≥0.625. Building upon an approach proposed by Steinerberger (2015), we improve the lower bound to β≥0.6277.
Date issued
2020-01Department
Massachusetts Institute of Technology. Department of Mathematics; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Operations Research Letters
Publisher
Elsevier BV
Citation
Gaudio, Julia and Patrick Jaillet. “An improved lower bound for the Traveling Salesman constant.” Operations Research Letters, 48, 1 (Janauary 2020): 67-70 © 2020 The Author(s)
Version: Original manuscript
ISSN
0167-6377