THE PRIZE COLLECTING TRAVELING SALESMAN PROBLEM

被引：347
作者：
BALAS, E
机构：
来源：
NETWORKS | 1989年 / 19卷 / 06期
关键词：
D O I：
10.1002/net.3230190602
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：621 / 636
页数：16
相关论文
共 13 条
  • [1] FACETS OF KNAPSACK POLYTOPE
    BALAS, E
    [J]. MATHEMATICAL PROGRAMMING, 1975, 8 (02) : 146 - 164
  • [2] FACETS OF KNAPSACK POLYTOPE FROM MINIMAL COVERS
    BALAS, E
    ZEMEL, E
    [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1978, 34 (01) : 119 - 148
  • [3] A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM
    BALAS, E
    CHRISTOFIDES, N
    [J]. MATHEMATICAL PROGRAMMING, 1981, 21 (01) : 19 - 46
  • [4] BALAS E, 1986, APR ORSA TIMS M LOS
  • [5] GROTSCHEL M, 1985, TRAVELING SALESMAN P, pCH8
  • [6] GROTSCHEL M, 1977, POLYEDRISCHE CHARAKT
  • [7] FACET OF REGULAR 0-1 POLYTOPES
    HAMMER, PL
    JOHNSON, EL
    PELED, UN
    [J]. MATHEMATICAL PROGRAMMING, 1975, 8 (02) : 179 - 206
  • [8] Lawler E. L., 1985, TRAVELING SALESMAN P
  • [9] Nemhauser G. L., 1974, Mathematical Programming, V6, P48, DOI 10.1007/BF01580222
  • [10] Padberg M. W., 1973, Mathematical Programming, V5, P199, DOI 10.1007/BF01580121
12