Class of the efficient general parallel branch-and-bound algorithm

被引:0
|
作者
Wu, Jigang
Chen, Guoliang
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:1146 / 1149
相关论文
共 50 条
  • [41] An efficient branch-and-bound algorithm for the assignment of protein backbone NMR peaks
    Lin, GH
    Xu, D
    Chen, ZZ
    Jiang, T
    Wen, JJ
    Xu, Y
    CSB2002: IEEE COMPUTER SOCIETY BIOINFORMATICS CONFERENCE, 2002, : 165 - 174
  • [42] An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
    Li, Chu-Min
    Quan, Zhe
    PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 128 - 133
  • [43] An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
    Tomita, Etsuji
    Kameda, Toshikatsu
    JOURNAL OF GLOBAL OPTIMIZATION, 2007, 37 (01) : 95 - 111
  • [44] BRANCH-AND-BOUND AND PARALLEL COMPUTATION - A HISTORICAL NOTE
    PRUUL, EA
    NEMHAUSER, GL
    RUSHMEIER, RA
    OPERATIONS RESEARCH LETTERS, 1988, 7 (02) : 65 - 69
  • [45] COPING WITH ANOMALIES IN PARALLEL BRANCH-AND-BOUND ALGORITHMS
    LI, GJ
    WAH, BW
    IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (06) : 568 - 573
  • [46] A parallel branch-and-bound method for cluster analysis
    Iyer, LS
    Aronson, JE
    ANNALS OF OPERATIONS RESEARCH, 1999, 90 (0) : 65 - 86
  • [47] PARALLEL BRANCH-AND-BOUND ALGORITHMS FOR COMBINATORIAL OPTIMIZATION
    PARDALOS, P
    LI, XO
    SUPERCOMPUTER, 1990, 7 (05): : 23 - 30
  • [48] PARALLEL BRANCH-AND-BOUND ALGORITHMS - SURVEY AND SYNTHESIS
    GENDRON, B
    CRAINIC, TG
    OPERATIONS RESEARCH, 1994, 42 (06) : 1042 - 1066
  • [49] Efficient parallel branch-and-bound approaches for exact graph edit distance problem
    Dabah, Adel
    Chegrane, Ibrahim
    Yahiaoui, Said
    Bendjoudi, Ahcene
    Nouali-Taboudjemat, Nadia
    PARALLEL COMPUTING, 2022, 114
  • [50] A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
    Hung, Yi-Feng
    Chen, Wei-Chih
    JOURNAL OF GLOBAL OPTIMIZATION, 2011, 51 (01) : 133 - 148