Facets of the asymmetric traveling salesman problem

被引:0
|
作者
机构
来源
| 1600年 / 16期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [21] Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
    Paluch, Katarzyna
    Elbassioni, Khaled
    van Zuylen, Anke
    29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 501 - 506
  • [22] AN ADDITIVE BOUNDING PROCEDURE FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM
    FISCHETTI, M
    TOTH, P
    MATHEMATICAL PROGRAMMING, 1992, 53 (02) : 173 - 197
  • [23] A new memetic algorithm for the asymmetric traveling salesman problem
    Buriol, L
    França, PM
    Moscato, P
    JOURNAL OF HEURISTICS, 2004, 10 (05) : 483 - 506
  • [24] Lifted cycle inequalities for the asymmetric traveling salesman problem
    Balas, E
    Fischetti, M
    MATHEMATICS OF OPERATIONS RESEARCH, 1999, 24 (02) : 273 - 292
  • [25] Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
    An, Hyung-Chan
    Kleinberg, Robert D.
    Shmoys, David B.
    ACM TRANSACTIONS ON ALGORITHMS, 2021, 17 (04)
  • [26] A simple LP relaxation for the asymmetric traveling salesman problem
    Thanh Nguyen
    MATHEMATICAL PROGRAMMING, 2013, 141 (1-2) : 549 - 559
  • [27] Cluster based branching for the asymmetric traveling salesman problem
    Lysgaard, J
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 119 (02) : 314 - 325
  • [28] 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
  • [29] On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
    Nagarajan, Viswanath
    Theory of Computing, 2008, 4 : 191 - 193
  • [30] A simple LP relaxation for the asymmetric traveling salesman problem
    Thành Nguyen
    Mathematical Programming, 2013, 141 : 549 - 559