Effective implementation of algorithm for solving the travelling salesman problem by branch-and-bound method

被引：6
|
作者：
Kostyuk, Yu L.
机构：
来源：
PRIKLADNAYA DISKRETNAYA MATEMATIKA | 2013年 / 20卷 / 02期
关键词：
D O I：
10.17223/20710410/20/9
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：78 / 90
页数：13
相关论文
共 50 条
  • [1] Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem
    Nikolaev, Alexey
    Batsyn, Mikhail
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2018, 2018, 10979 : 311 - 322
  • [2] THE TRAVELLING SALESMAN PROBLEM: IMPROVED LOWER BOUND IN THE BRANCH-AND-BOUND METHOD
    Kostyuk, Y. L.
    [J]. PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 22 (04): : 73 - +
  • [3] Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem
    Markevich E.A.
    Trushechkin A.S.
    [J]. Journal of Mathematical Sciences, 2019, 241 (2) : 168 - 184
  • [4] A branch-and-bound algorithm for the double travelling salesman problem with two stacks
    Carrabs, Francesco
    Cerulli, Raffaele
    Speranza, Maria Grazia
    [J]. NETWORKS, 2013, 61 (01) : 58 - 75
  • [5] A branch-and-bound algorithm for the time-dependent travelling salesman problem
    Arigliano, Anna
    Calogiuri, Tobia
    Ghiani, Gianpaolo
    Guerriero, Emanuela
    [J]. NETWORKS, 2018, 72 (03) : 382 - 392
  • [6] SOLVING THE TRAVELLING SALESMAN PROBLEM USING THE BRANCH AND BOUND METHOD
    Mataija, Mirta
    Segic, Mirjana Rakamaric
    Jozic, Franciska
    [J]. ZBORNIK VELEUCILISTA U RIJECI-JOURNAL OF THE POLYTECHNICS OF RIJEKA, 2016, 4 (01): : 259 - +
  • [7] Fast Branch and Bound Algorithm for the Travelling Salesman Problem
    Grymin, Radoslaw
    Jagiello, Szymon
    [J]. COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT, CISIM 2016, 2016, 9842 : 206 - 217
  • [8] 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
  • [9] 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
  • [10] THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION
    Kostyuk, Yu L.
    [J]. PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2019, (45): : 104 - 112
12345