Show simple item record

dc.contributor.authorGaudio, Julia
dc.contributor.authorJaillet, Patrick
dc.date.accessioned2021-01-08T14:02:39Z
dc.date.available2021-01-08T14:02:39Z
dc.date.issued2020-01
dc.identifier.issn0167-6377
dc.identifier.urihttps://hdl.handle.net/1721.1/129336
dc.description.abstractLet 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.en_US
dc.language.isoen
dc.publisherElsevier BVen_US
dc.relation.isversionof10.1016/J.ORL.2019.11.007en_US
dc.rightsCreative Commons Attribution-NonCommercial-NoDerivs Licenseen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en_US
dc.sourcearXiven_US
dc.titleAn improved lower bound for the Traveling Salesman constanten_US
dc.typeArticleen_US
dc.identifier.citationGaudio, 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)en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.relation.journalOperations Research Lettersen_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2020-12-21T18:35:14Z
dspace.orderedauthorsGaudio, J; Jaillet, Pen_US
dspace.date.submission2020-12-21T18:35:15Z
mit.journal.volume48en_US
mit.journal.issue1en_US
mit.licensePUBLISHER_CC
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record