A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM

被引：100

作者：

BALAS, E ^{[1
]}

CHRISTOFIDES, N ^{[1
]}

机构：

[1] UNIV LONDON IMPERIAL COLL SCI & TECHNOL,LONDON SW7 2AZ,ENGLAND

来源：

关键词：

D O I：

10.1007/BF01584228

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：19 / 46

页数：28

共 19 条

[1] [Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
[2] BALAS E, 1980, MATH PROGRAM STUD, V12, P19, DOI 10.1007/BFb0120885
[3] BALAS E, 1976, 9TH INT S MATH PROGR
[4] TRAVELING SALESMAN PROBLEM - A SURVEY
BELLMORE, M
NEHAUSE.GL
[J]. OPERATIONS RESEARCH, 1968, 16 (03) : 538 - &
[5] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS
BELLMORE, M
MALONE, JC
[J]. OPERATIONS RESEARCH, 1971, 19 (02) : 278 - &
[6] Burkard R.E., 1979, DISCRETE OPTIM, V4, P193
[7] Christofides N., 1979, Combinatorial optimization, P131
[8] BOUNDS FOR TRAVELLING-SALESMAN PROBLEM
CHRISTOFIDES, N
[J]. OPERATIONS RESEARCH, 1972, 20 (05) : 1044 - +
[9] SHORTEST HAMILTONIAN CHAIN OF A GRAPH
CHRISTOFIDES, N
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 19 (04) : 689 - +
[10] Christofides N, 1976, GRAPH THEORY ALGORIT