ADJACENCY OF TRAVELING SALESMAN TOURS AND 0-1 VERTICES

被引：16
|
作者：
RAO, MR [1 ]
机构：
[1] UNIV ROCHESTER,SCH MANAGEMENT,ROCHESTER,NY 14627
来源：
SIAM JOURNAL ON APPLIED MATHEMATICS | 1976年 / 30卷 / 02期
关键词：
D O I：
10.1137/0130021
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：191 / 198
页数：8
相关论文
共 50 条
  • [1] All 0-1 polytopes are traveling salesman polytopes
    Billera, LJ
    Sarangarajan, A
    [J]. COMBINATORICA, 1996, 16 (02) : 175 - 188
  • [2] ON TOURS OF A TRAVELING SALESMAN
    MURTY, KG
    [J]. SIAM JOURNAL ON CONTROL, 1969, 7 (01): : 122 - &
  • [3] TOURS FOR THE TRAVELING SALESMAN
    WARREN, RH
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 1991, 46 (03) : 167 - 177
  • [4] PYRAMIDAL TOURS AND THE TRAVELING SALESMAN PROBLEM
    VANDERVEEN, JAA
    SIERKSMA, G
    VANDAL, R
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 52 (01) : 90 - 102
  • [5] DISTANCES BETWEEN TRAVELING SALESMAN TOURS
    MAK, KT
    MORTON, AJ
    [J]. DISCRETE APPLIED MATHEMATICS, 1995, 58 (03) : 281 - 291
  • [6] ADJACENCY OF THE 0-1 KNAPSACK-PROBLEM
    GEIST, D
    RODIN, EY
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1992, 19 (08) : 797 - 800
  • [7] ADJACENT VERTICES OF THE ALL 0-1 PROGRAMMING POLYTOPE
    BALAS, E
    PADBERG, MW
    [J]. RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1979, 13 (01): : 3 - 12
  • [8] Random tours in the traveling salesman problem: Analysis and application
    Basel, H
    Willemain, TR
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2001, 20 (02) : 211 - 217
  • [9] Euclidean Traveling Salesman Tours through Stochastic Neighborhoods
    Kamousi, Pegah
    Suri, Subhash
    [J]. ALGORITHMS AND COMPUTATION, 2013, 8283 : 644 - 654
  • [10] Reoptimization of minimum and maximum traveling salesman's tours
    Ausiello, Giorgio
    Escoffier, Bruno
    Monnot, Jerome
    Paschos, Vangelis
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 453 - 463
12345