PROBABILISTIC ANALYSIS OF THE HELD AND KARP LOWER BOUND FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM

被引:21
作者
GOEMANS, MX [1 ]
BERTSIMAS, DJ [1 ]
机构
[1] MIT,ALFRED P SLOAN SCH MANAGEMENT,CAMBRIDGE,MA 02139
关键词
PROBABILISTIC ANALYSIS; TRAVELING SALESMAN PROBLEM; LINEAR PROGRAMMING RELAXATION; 1-TREES; SUBADDITIVE EUCLIDEAN FUNCTIONALS;
D O I
10.1287/moor.16.1.72
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We analyze probabilistically the classical Held-Karp lower bound derived from the 1-tree relaxation for the Euclidean traveling salesman problem (ETSP). We prove that, if n points are identically and independently distributed according to a distribution with bounded support and absolutely continuous part f(x) dx over the d-cube, the Held-Karp lower bound on these n points is almost surely asymptotic to beta-HK(d)n(d-1)/d integral f(x)(d-1)/d dx, where beta-HK(d) is a constant independent of n. The result suggests a probabilistic explanation of the observation that the lower bound is very close to the length of the optimal tour in practice, since the ETSP is almost surely asymptotic to beta-TSP(d)n(d-1)/d integral f(x)(d-1)/d dx. The techniques we use exploit the polyhedral description of the Held-Karp lower bound and the theory of subadditive Euclidean functionals.
引用
收藏
页码:72 / 89
页数:18
相关论文
共 26 条
[1]  
BALAS E, 1985, TRAVELING SALESMAN P
[2]  
Beardwood J, 1959, P CAMBRIDGE PHILOS S, V55, P299, DOI [DOI 10.1017/S0305004100034095, 10.1017/S0305004100034095]
[3]  
Christofides N., 1979, COMBINATORIAL OPTIMI
[4]  
Edmonds J., 1971, MATH PROGRAM, V1, P127, DOI [10.1007/BF01584082, DOI 10.1007/BF01584082]
[5]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[6]  
Geoffrion A.M., 1974, MATH PROGRAMMING STU, P82, DOI DOI 10.1007/BFB0120686
[7]   RANDOM MINIMAL TREES [J].
GILBERT, EN .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1965, 13 (02) :376-&
[8]  
GOEMANS MX, 1990, UNPUB DISCRETE ALGOR, P388
[9]  
HANSEN KH, 1974, MATH PROGRAM, V7, P87
[10]  
Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223