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 条

[21] A constant approximation algorithm for the a priori traveling salesman problem
Shmoys, David
Talwar, Kunal
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 2008, 5035 : 331 - +
[22] A NETWORK BRANCH AND BOUND APPROACH FOR THE TRAVELING SALESMAN MODEL
Munapo, Elias
SOUTH AFRICAN JOURNAL OF ECONOMIC AND MANAGEMENT SCIENCES, 2013, 16 (01): : 52 - 63
[23] A Branch and Bound Algorithm for the Probabilistic Traveling Salesman Problem
Mahfoudh, Soumaya Sassi
Khaznaji, Walid
Bellalouna, Monia
2015 16TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2015, : 697 - 702
[24] An Improved Hybrid Algorithm for Traveling Salesman Problem
Bai, Qiuying
Li, Guizhi
Sun, Qiheng
2015 8TH INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS (BMEI), 2015, : 806 - 809
[25] An improved firefly algorithm for traveling salesman problems
Wang Ming-bo
Fu Qiang
Tong Nan
Li Mengmeng
Zhao Yiming
PROCEEDINGS OF THE 2015 4TH NATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS AND COMPUTER ENGINEERING ( NCEECE 2015), 2016, 47 : 1085 - 1092
[26] An improved genetic algorithm for the traveling salesman problem
Li, Lijie
Zhang, Ying
ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES, 2007, 2 : 208 - +
[27] An improved heuristic for the period traveling salesman problem
Bertazzi, L
Paletta, G
Speranza, MG
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (08) : 1215 - 1222
[28] λ > 4 An Improved Lower Bound on the Growth Constant of Polyominoes
Barequet, Gill
Rote, Guenter
Shalah, Mira
COMMUNICATIONS OF THE ACM, 2016, 59 (07) : 88 - 95
[29] AN IMPROVED LOWER BOUND FOR THE DE BRUIJN-NEWMAN CONSTANT
Saouter, Yannick
Gourdon, Xavier
Demichel, Patrick
MATHEMATICS OF COMPUTATION, 2011, 80 (276) : 2281 - 2287
[30] NEW LOWER BOUNDS FOR THE SYMMETRIC TRAVELING SALESMAN PROBLEM
CARPANETO, G
FISCHETTI, M
TOTH, P
MATHEMATICAL PROGRAMMING, 1989, 45 (02) : 233 - 254

← 1 2 3 4 5 →