USING CUTTING PLANES TO SOLVE SYMMETRIC TRAVELING SALESMAN PROBLEM

被引：61

作者：

MILIOTIS, P ^{[1
]}

机构：

[1] UNIV LONDON,LONDON SCH ECON & POLIT SCI,LONDON WC2A 2AE,ENGLAND

来源：

关键词：

D O I：

10.1007/BF01609016

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：177 / 188

页数：12

共 14 条

[1] [Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
[2] TRAVELING SALESMAN PROBLEM - A SURVEY
BELLMORE, M
NEHAUSE.GL
[J]. OPERATIONS RESEARCH, 1968, 16 (03) : 538 - &
[3] ON A LINEAR-PROGRAMMING, COMBINATORIAL APPROACH TO THE TRAVELING-SALESMAN PROBLEM
DANTZIG, GB
FULKERSON, DR
JOHNSON, SM
[J]. OPERATIONS RESEARCH, 1959, 7 (01) : 58 - 66
[4] Gomory R.E, 1963, RECENT ADV MATH PROG, P269
[5] HELBIGHANSEN KH, 1974, MATH PROGRAM, V7, P87
[6] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS
HELD, M
KARP, RM
[J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01): : 196 - 210
[7] Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]
[8] A HEURISTIC APPROACH TO SOLVING TRAVELING SALESMAN PROBLEMS
KARG, RL
THOMPSON, GL
[J]. MANAGEMENT SCIENCE, 1964, 10 (02) : 225 - 248
[9] LAND AH, 1973, FORTRAN CODES MATH P
[10] MARTIN GT, 1963, RECENT ADV MATH PROG, P311