BRANCH AND BOUND ALGORITHMS - TRAVELING SALESMAN PROBLEM

被引:0
|
作者
PARSONS, JA
机构
来源
JOURNAL OF SYSTEMS MANAGEMENT | 1969年 / 20卷 / 08期
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:38 / 40
页数:3
相关论文
共 50 条
  • [1] Algorithms based on branch and bound for the flying sidekick traveling salesman problem
    Dell'Amico, Mauro
    Montemanni, Roberto
    Novellani, Stefano
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 104
  • [2] Algorithms based on branch and bound for the flying sidekick traveling salesman problem
    Dell'Amico, Mauro
    Montemanni, Roberto
    Novellani, Stefano
    [J]. Omega (United Kingdom), 2021, 104
  • [3] A Branch and Bound Algorithm for the Probabilistic Traveling Salesman Problem
    Mahfoudh, Soumaya Sassi
    Khaznaji, Walid
    Bellalouna, Monia
    [J]. 2015 16TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2015, : 697 - 702
  • [4] A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem
    Melamed, II
    Sigal, IK
    [J]. AUTOMATION AND REMOTE CONTROL, 1997, 58 (10) : 1706 - 1711
  • [5] Solving Standard Traveling Salesman Problem and Multiple Traveling Salesman Problem by Using Branch-and-Bound
    Saad, Shakila
    Jaafar, Wan Nurhadani Wan
    Jamil, Siti Jasmida
    [J]. 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
  • [6] A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
    Poikonen, Stefan
    Golden, Bruce
    Wasil, Edward A.
    [J]. INFORMS JOURNAL ON COMPUTING, 2019, 31 (02) : 335 - 346
  • [7] A Branch-and-Bound-Based Crossover Operator for the Traveling Salesman Problem
    Weise, Thomas
    Jiang, Yan
    Qi, Qi
    Liu, Weichen
    [J]. INTERNATIONAL JOURNAL OF COGNITIVE INFORMATICS AND NATURAL INTELLIGENCE, 2019, 13 (03) : 1 - 18
  • [8] Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem
    Salman, Raad
    Ekstedt, Fredrik
    Damaschke, Peter
    [J]. OPERATIONS RESEARCH LETTERS, 2020, 48 (02) : 163 - 166
  • [9] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
    Maksimenko, A. N.
    [J]. AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2021, 55 (07) : 816 - 826
  • [10] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
    A. N. Maksimenko
    [J]. Automatic Control and Computer Sciences, 2021, 55 : 816 - 826