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 条
  • [21] A simple algorithm for solving travelling salesman problem
    An Kai
    Xing Mingrui
    [J]. PROCEEDINGS OF THE 2012 SECOND INTERNATIONAL CONFERENCE ON INSTRUMENTATION & MEASUREMENT, COMPUTER, COMMUNICATION AND CONTROL (IMCCC 2012), 2012, : 931 - 935
  • [22] A branch-and-bound algorithm for solving max-k-cut problem
    Lu, Cheng
    Deng, Zhibin
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2021, 81 (02) : 367 - 389
  • [23] A branch-and-bound algorithm for solving max-k-cut problem
    Cheng Lu
    Zhibin Deng
    [J]. Journal of Global Optimization, 2021, 81 : 367 - 389
  • [24] Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
    Haouari, M
    Chaouachi, J
    Dror, M
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (04) : 382 - 389
  • [25] Solving the Time Dependent Chinese Postman Problem by Branch-and-Bound Algorithm
    Tan, Guozhen
    Sun, Jinghao
    Meng, Yakun
    [J]. INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2012, 15 (12A): : 5263 - 5270
  • [26] PARTITIONING FEASIBLE SET IN A BRANCH-AND-BOUND ALGORITHM FOR ASYMMETRIC TRAVELING-SALESMAN PROBLEM
    GARFINKEL, RS
    [J]. OPERATIONS RESEARCH, 1973, 21 (01) : 340 - 343
  • [27] A fast branch-and-bound algorithm with an improved lower bound for solving the multiprocessor scheduling problem
    Fujita, S
    Masukawa, M
    Tagashira, S
    [J]. NINTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2002, : 611 - 616
  • [28] A BRANCH-AND-BOUND ALGORITHM IN THE TOURING PATH PROBLEM AND ITS COMPUTER IMPLEMENTATION
    XU, XS
    [J]. ACTA MATHEMATICA SCIENTIA, 1994, 14 (02) : 139 - 145
  • [29] 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
  • [30] An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
    Lianbo Gao
    Shashi K. Mishra
    Jianming Shi
    [J]. Optimization Letters, 2012, 6 : 221 - 230
12345