An improved lower bound for the Traveling Salesman constant

被引：1

作者：

Gaudio, Julia ^{[1
]}

Jaillet, Patrick ^{[2
]}

机构：

[1] MIT, Operat Res Ctr, 1 Amherst St, Cambridge, MA 02142 USA

[2] MIT, Dept Elect Engn & Comp Sci, Cambridge, MA 02139 USA

来源：

OPERATIONS RESEARCH LETTERS | 2020年 / 48卷 / 01期

关键词：

Traveling Salesman problem; Geometric probability; Euclidean combinatorial optimization;

D O I：

10.1016/j.orl.2019.11.007

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Let X-1, X-2, ..., X-n be independent uniform random variables on [0, 1](2). Let L(X-1, ..., X-n) be the length of the shortest Traveling Salesman tour through these points. Beardwood et al (1959) showed that there exists a constant beta such that lim(n ->infinity)L(X-1, ..., X-n)/root n=beta almost surely. It was shown that beta >= 0.625. Building upon an approach proposed by Steinerberger (2015), we improve the lower bound to beta >= 0.6277. (C) 2019 Elsevier B.V. All rights reserved.

引用

页码：67 / 70

页数：4

共 50 条

[1] AN IMPROVED ASSIGNMENT LOWER BOUND FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
STEWART, WR
OPERATIONS RESEARCH LETTERS, 1985, 4 (02) : 55 - 60
[2] A lower bound for adjacencies on the traveling salesman polytope
Sarangarajan, A
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1997, 10 (03) : 431 - 435
[3] IMPROVED LOWER BOUNDS TO THE TRAVELING SALESMAN PROBLEM
DATRI, G
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1978, 12 (04): : 369 - 382
[4] Improved lower bounds on the approximability of the Traveling Salesman Problem
Böckenhauer, HJ
Seibert, S
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (03): : 213 - 255
[5] A new lower bound for the geometric traveling salesman problem in terms of discrepancy
Steinerberger, Stefan
OPERATIONS RESEARCH LETTERS, 2010, 38 (04) : 318 - 319
[6] Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
Toriello, Alejandro
MATHEMATICAL PROGRAMMING, 2014, 144 (1-2) : 247 - 264
[7] Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
Alejandro Toriello
Mathematical Programming, 2014, 144 : 247 - 264
[8] PROBABILISTIC ANALYSIS OF THE HELD AND KARP LOWER BOUND FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
GOEMANS, MX
BERTSIMAS, DJ
MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (01) : 72 - 89
[9] THE TRAVELLING SALESMAN PROBLEM: IMPROVED LOWER BOUND IN THE BRANCH-AND-BOUND METHOD
Kostyuk, Y. L.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 22 (04): : 73 - +
[10] Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem
Carrabs, Francesco
Cerrone, Carmine
Cerulli, Raffaele
D'Ambrosio, Ciriaco
GREEN, PERVASIVE, AND CLOUD COMPUTING (GPC 2017), 2017, 10232 : 165 - 177

← 1 2 3 4 5 →