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

被引：0
|
作者：
徐绪松
机构：
来源：
Acta Mathematica Scientia | 1994年 / 02期
关键词：
D O I：
暂无
中图分类号：
O241 [数值分析];
学科分类号：
070102 ;
摘要：
ＡＢＲＡＮＣＨ－ＡＮＤ－ＢＯＵＮＤＡＬＧＯＲＩＴＨＭＩＮＴＨＥＴＯＵＲＩＮＧ－ＰＡＴＨＰＲＯＢＬＥＭＡＮＤＩＴＳＣＯＭＰＵＴＥＲＩＭＰＬＥＭＥＮＴＡＴＩＯＮＸｕＸｕｓｏｎｇ（徐绪松）（ＳｃｈｏｏｌｏｆＭａｎａｇｅｍｅｎｔ，ＷｕｈａｎＵｎｉｖｅｒｓｉｔ...
引用
下载
收藏
页码：139 / 145
页数：7
相关论文
共 50 条
  • [31] A branch-and-bound algorithm for the linear ordering problem with cumulative costs
    Righini, Giovanni
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 186 (03) : 965 - 971
  • [32] A new branch-and-bound algorithm for the Maximum Weighted Clique Problem
    San Segundo, Pablo
    Furini, Fabio
    Artieda, Jorge
    COMPUTERS & OPERATIONS RESEARCH, 2019, 110 : 18 - 33
  • [33] Fleet Assignment Problem Study Based on Branch-and-bound Algorithm
    Wu Donghua
    Xia Hongshan
    Fan Yongjun
    Zhang Jinyuan
    PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON MECHATRONICS, CONTROL AND ELECTRONIC ENGINEERING, 2014, 113 : 16 - 20
  • [34] Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
    Shimizu, Satoshi
    Yamaguchi, Kazuaki
    Masuda, Sumio
    DISCRETE OPTIMIZATION, 2021, 41
  • [35] A branch-and-bound algorithm for the minimum cut linear arrangement problem
    Palubeckis, Gintaras
    Rubliauskas, Dalius
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (04) : 540 - 563
  • [36] A Branch-and-Bound Algorithm for Minimizing the Energy Consumption in the PFS Problem
    Liu, Guo-Sheng
    Zhang, Bi-Xi
    Yang, Hai-Dong
    Chen, Xin
    Huang, George Q.
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [37] A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
    Coniglio, Stefano
    Furini, Fabio
    San Segundo, Pablo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (02) : 435 - 455
  • [38] An effective branch-and-bound algorithm for the maximum s -bundle problem
    Zhou, Yi
    Lin, Weibo
    Hao, Jin-Kao
    Xiao, Mingyu
    Jin, Yan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 297 (01) : 27 - 39
  • [39] A lookahead branch-and-bound algorithm for the maximum quartet consistency problem
    Wu, G
    You, JH
    Lin, GH
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2005, 3692 : 65 - 76
  • [40] A geometric branch-and-bound algorithm for the service bundle design problem
    Li, Yifu
    Qi, Xiangtong
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 303 (03) : 1044 - 1056
12345