A BRANCH-AND-BOUND ALGORITHM IN THE TOURING-PATH PROBLEM AND ITS COMPUTER IMPLEMENTATION

被引:0
|
作者
徐绪松
机构
关键词
D O I
暂无
中图分类号
O241 [数值分析];
学科分类号
070102 ;
摘要
ABRANCH-AND-BOUNDALGORITHMINTHETOURING-PATHPROBLEMANDITSCOMPUTERIMPLEMENTATIONXuXusong(徐绪松)(SchoolofManagement,WuhanUniversit...
引用
下载
收藏
页码:139 / 145
页数:7
相关论文
共 50 条
  • [1] A BRANCH-AND-BOUND ALGORITHM IN THE TOURING PATH PROBLEM AND ITS COMPUTER IMPLEMENTATION
    XU, XS
    ACTA MATHEMATICA SCIENTIA, 1994, 14 (02) : 139 - 145
  • [2] OPTIMAL NETWORK PROBLEM - BRANCH-AND-BOUND ALGORITHM
    BOYCE, DE
    FARHI, A
    WEISCHEDEL, R
    ENVIRONMENT AND PLANNING A, 1973, 5 (04) : 519 - 533
  • [3] A branch-and-bound algorithm for the cell formation problem
    Utkina, Irina E.
    Batsyn, Mikhail V.
    Batsyna, Ekaterina K.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (09) : 3262 - 3273
  • [4] A branch-and-bound algorithm for the acyclic partitioning problem
    Nossack, Jenny
    Pesch, Erwin
    COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 174 - 184
  • [5] A branch-and-bound algorithm for the coupled task problem
    Bekesi, Jozsef
    Galambos, Gabor
    Jung, Michael N.
    Oswald, Marcus
    Reinelt, Gerhard
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2014, 80 (01) : 47 - 81
  • [6] A Branch-and-Bound Algorithm for the Talent Scheduling Problem
    Liang, Xiaocong
    Zhang, Zizhen
    Qin, Hu
    Guo, Songshan
    Lim, Andrew
    MODERN ADVANCES IN APPLIED INTELLIGENCE, IEA/AIE 2014, PT I, 2014, 8481 : 208 - 217
  • [7] An enhanced branch-and-bound algorithm for a partitioning problem
    Brusco, MJ
    BRITISH JOURNAL OF MATHEMATICAL & STATISTICAL PSYCHOLOGY, 2003, 56 : 83 - 92
  • [8] A branch-and-bound algorithm for the coupled task problem
    József Békési
    Gábor Galambos
    Michael N. Jung
    Marcus Oswald
    Gerhard Reinelt
    Mathematical Methods of Operations Research, 2014, 80 : 47 - 81
  • [9] Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem
    Markevich E.A.
    Trushechkin A.S.
    Journal of Mathematical Sciences, 2019, 241 (2) : 168 - 184
  • [10] Effective implementation of algorithm for solving the travelling salesman problem by branch-and-bound method
    Kostyuk, Yu L.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 20 (02): : 78 - 90