ON THE RELATION BETWEEN THE TRAVELING-SALESMAN AND THE LONGEST-PATH PROBLEMS

被引：24

作者：

HARDGRAVE, WW

NEMHAUSER, GL

机构：

来源：

OPERATIONS RESEARCH | 1962年 / 10卷 / 05期

关键词：

D O I：

10.1287/opre.10.5.647

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：647 / 657

页数：11

相关论文

共 10 条

[1] ACKOFF RL, 1961, PROGR OPERATIONS RES, V1
[2] [Anonymous], 1961, J MATH ANAL APPL
[3] A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS
CROES, GA
[J]. OPERATIONS RESEARCH, 1958, 6 (06) : 791 - 812
[4] 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
[5] DISCRETE-VARIABLE EXTREMUM PROBLEMS
DANTZIG, GB
[J]. OPERATIONS RESEARCH, 1957, 5 (02) : 266 - 277
[6] A METHOD FOR THE SOLUTION OF THE NTH BEST PATH PROBLEM
HOFFMAN, W
PAVLEY, R
[J]. JOURNAL OF THE ACM, 1959, 6 (04) : 506 - 514
[7] HOFFMAN W, 1958, P WESTERN JOINT COMP, P159
[8] THE SHORTEST-ROUTE PROBLEM
PEART, RM
RANDOLPH, PH
BARTLETT, TE
[J]. OPERATIONS RESEARCH, 1960, 8 (06) : 866 - 868
[9] SOLUTIONS OF THE SHORTEST-ROUTE PROBLEM - A REVIEW
POLLACK, M
WIEBENSON, W
[J]. OPERATIONS RESEARCH, 1960, 8 (02) : 224 - 230
[10] THE KTH BEST ROUTE THROUGH A NETWORK
POLLACK, M
[J]. OPERATIONS RESEARCH, 1961, 9 (04) : 578 - 580