THE SYMMETRIC TRAVELING SALESMAN PROBLEM AND EDGE EXCHANGES IN MINIMAL 1-TREES

被引：36

作者：

VOLGENANT, T

JONKER, R

机构：

来源：

关键词：

D O I：

10.1016/0377-2217(83)90161-3

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：394 / 403

页数：10

共 19 条

[1] Christofides N., 2022, OPERATIONS RES FORUM, V3, DOI [10.1007/s43069-021-00101-z, DOI 10.1007/S43069-021-00101-Z]
[2] SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY
CROWDER, H
PADBERG, MW
[J]. MANAGEMENT SCIENCE, 1980, 26 (05) : 495 - 509
[3] Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390
[4] Ford L. R., 1962, FLOWS NETWORKS
[5] Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]
[6] GROTSCHEL M, 1980, MATH PROGRAM STUD, V12, P61
[7] GROTSCHEL M, 1977, POLYHEDRISCHE CHARAK
[8] TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES
HELD, M
KARP, RM
[J]. OPERATIONS RESEARCH, 1970, 18 (06) : 1138 - &
[9] HELD M, 1962, SIAM J, V10, P196
[10] Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]