An improved lower bound for the Traveling Salesman constant
Name
1907.02390.pdf
Description
Submitted version
Size
125.42 KB
Format
Adobe PDF
Checksum (MD5)
2942b00be1af2288d1c90c265f099f6c
Author(s)
Gaudio, Julia
Jaillet, Patrick
Date Issued
January 2020
Journal
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
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.ORL.2019.11.007
