An improved lower bound for the Traveling Salesman constant
Author(s)Gaudio, Julia; Jaillet, Patrick
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Department of Mathematics; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Operations Research Letters
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)