AN IMPROVED ASSIGNMENT LOWER BOUND FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM

被引：4
|
作者：
STEWART, WR
机构：
来源：
OPERATIONS RESEARCH LETTERS | 1985年 / 4卷 / 02期
关键词：
D O I：
10.1016/0167-6377(85)90032-X
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：55 / 60
页数：6
相关论文
共 50 条
  • [21] Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
    Alejandro Toriello
    Mathematical Programming, 2014, 144 : 247 - 264
  • [22] THE TRAVELLING SALESMAN PROBLEM: IMPROVED LOWER BOUND IN THE BRANCH-AND-BOUND METHOD
    Kostyuk, Y. L.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 22 (04): : 73 - +
  • [23] BRANCH AND BOUND ALGORITHMS - TRAVELING SALESMAN PROBLEM
    PARSONS, JA
    JOURNAL OF SYSTEMS MANAGEMENT, 1969, 20 (08): : 38 - 40
  • [24] Solving Standard Traveling Salesman Problem and Multiple Traveling Salesman Problem by Using Branch-and-Bound
    Saad, Shakila
    Jaafar, Wan Nurhadani Wan
    Jamil, Siti Jasmida
    PROCEEDINGS OF THE 20TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM20): RESEARCH IN MATHEMATICAL SCIENCES: A CATALYST FOR CREATIVITY AND INNOVATION, PTS A AND B, 2013, 1522 : 1406 - 1411
  • [25] PROBABILISTIC ANALYSIS OF SOLVING THE ASSIGNMENT PROBLEM FOR THE TRAVELING SALESMAN PROBLEM
    PANAYIOTOPOULOS, JC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 9 (01) : 77 - 82
  • [26] Job Assignment Problem and Traveling Salesman Problem: A Linked Optimisation Problem
    Ogunsemi, Akinola
    McCall, John
    Mathias.kern
    Lacroix, Benjamin
    Corsar, David
    Owusu, Gilbert
    ARTIFICIAL INTELLIGENCE XXXIX, AI 2022, 2022, 13652 : 19 - 33
  • [27] Ones Assignment Method for Solving Traveling Salesman Problem
    Basirzadeh, Hadi
    JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2014, 10 (04): : 258 - 265
  • [28] An Orientation Assignment Heuristic to the Dubins Traveling Salesman Problem
    Macharet, Douglas G.
    Campos, Mario F. M.
    ADVANCES IN ARTIFICIAL INTELLIGENCE (IBERAMIA 2014), 2014, 8864 : 457 - 468
  • [29] ALGORITHMS FOR SOLUTION OF THE TRAVELING SALESMAN PROBLEM .2. NEW LOWER-BOUND
    SERGEEV, SI
    AUTOMATION AND REMOTE CONTROL, 1994, 55 (06) : 861 - 868
  • [30] ANALYSIS OF TWO HEURISTICS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM.
    Bentley, Jon Louis
    Saxe, James B.
    Proceedings - Annual Allerton Conference on Communication, Control, and Computing, 1980, : 41 - 49
12345