TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES

被引：681
|
作者：
HELD, M
KARP, RM
机构：
来源：
OPERATIONS RESEARCH | 1970年 / 18卷 / 06期
关键词：
D O I：
10.1287/opre.18.6.1138
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：1138 / &
相关论文
共 50 条
  • [41] THE TRAVELING SALESMAN PROBLEM AND MINIMUM MATCHING IN THE UNIT SQUARE
    SUPOWIT, KJ
    REINGOLD, EM
    PLAISTED, DA
    SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 144 - 156
  • [42] GENERATING TRAVELING-SALESMAN PROBLEMS WITH KNOWN OPTIMAL TOURS
    ARTHUR, JL
    FRENDEWEY, JO
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (02) : 153 - 159
  • [43] PARTITIONING FEASIBLE SET IN A BRANCH-AND-BOUND ALGORITHM FOR ASYMMETRIC TRAVELING-SALESMAN PROBLEM
    GARFINKEL, RS
    OPERATIONS RESEARCH, 1973, 21 (01) : 340 - 343
  • [44] A MODIFIED LIN-KERNIGHAN TRAVELING-SALESMAN HEURISTIC
    MAK, KT
    MORTON, AJ
    OPERATIONS RESEARCH LETTERS, 1993, 13 (03) : 127 - 132
  • [45] UTILIZING TRAVELING-SALESMAN SUBTOURS TO CREATE SALES DISTRICTS
    FEIRING, BR
    ENGINEERING COSTS AND PRODUCTION ECONOMICS, 1986, 10 (03): : 211 - 215
  • [46] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS
    BELLMORE, M
    MALONE, JC
    OPERATIONS RESEARCH, 1971, 19 (02) : 278 - &
  • [47] THE MAXIMUM DISTANCE PROBLEM AND MINIMUM SPANNING TREES
    Alvarado, Enrique G.
    Krishnamoorthy, Bala
    Vixie, Kevin R.
    INTERNATIONAL JOURNAL OF ANALYSIS AND APPLICATIONS, 2021, 19 (05): : 633 - 659
  • [48] Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
    Paul, Alice
    Freund, Daniel
    Ferber, Aaron
    Shmoys, David B.
    Williamson, David P.
    MATHEMATICS OF OPERATIONS RESEARCH, 2020, 45 (02) : 576 - 590
  • [49] Ordering of high-density markers by the k-Optimal algorithm for the traveling-salesman problem
    Zhang, Luyan
    Li, Huihui
    Meng, Lei
    Wang, Jiankang
    CROP JOURNAL, 2020, 8 (05): : 701 - 712
  • [50] ON THE RELATION BETWEEN THE TRAVELING-SALESMAN AND THE LONGEST-PATH PROBLEMS
    HARDGRAVE, WW
    NEMHAUSER, GL
    OPERATIONS RESEARCH, 1962, 10 (05) : 647 - 657
12345