IMPROVED LOWER BOUNDS TO THE TRAVELING SALESMAN PROBLEM

被引：0
|
作者：
DATRI, G
机构：
来源：
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH | 1978年 / 12卷 / 04期
关键词：
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：369 / 382
页数：14
相关论文
共 50 条
  • [31] An Improved Discrete Firefly Algorithm for the Traveling Salesman Problem
    Zhou, Lingyun
    Ding, Lixin
    Qiang, Xiaoli
    Luo, Yihan
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1184 - 1189
  • [32] IMPROVED PARTICLE SWARM OPTIMIZATION FOR TRAVELING SALESMAN PROBLEM
    Xu, Xin-Li
    Cheng, Xu
    Yang, Zhong-Chen
    Yang, Xu-Hua
    Wang, Wan-Liang
    PROCEEDINGS 27TH EUROPEAN CONFERENCE ON MODELLING AND SIMULATION ECMS 2013, 2013, : 857 - +
  • [33] AN IMPROVED TRANSFORMATION OF THE SYMMETRIC MULTIPLE TRAVELING SALESMAN PROBLEM
    JONKER, R
    VOLGENANT, T
    OPERATIONS RESEARCH, 1988, 36 (01) : 163 - 167
  • [34] Improved extremal optimization for the asymmetric traveling salesman problem
    Chen, Yu-Wang
    Zhu, Yao-Jia
    Yang, Gen-Ke
    Lu, Yong-Zai
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2011, 390 (23-24) : 4459 - 4465
  • [35] FICTITIOUS UPPER-BOUNDS IN AN ALGORITHM FOR THE SYMMETRIC TRAVELING SALESMAN PROBLEM
    VOLGENANT, T
    JONKER, R
    COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (01) : 113 - 117
  • [36] The traveling salesman problem
    Punnen, A
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (04) : 295 - 296
  • [37] The traveling salesman problem
    Bangert, Patrick D.
    JOURNAL OF MATHEMATICAL PSYCHOLOGY, 2007, 51 (06) : 401 - 402
  • [38] TRAVELING SALESMAN PROBLEM
    GROTSCHEL, M
    PADBERG, MW
    OPERATIONS RESEARCH, 1975, 23 : B298 - B298
  • [39] The traveling salesman problem
    Gutin, Gregory
    Punnen, Abraham
    DISCRETE OPTIMIZATION, 2006, 3 (01) : 1 - 1
  • [40] Lower bounding procedure for the asymmetric quadratic traveling salesman problem
    Rostami, Borzou
    Malucelli, Federico
    Belotti, Pietro
    Gualandi, Stefano
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 253 (03) : 584 - 592
12345