COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS

被引：10
|
作者：
IBARAKI, T [1 ]
机构：
[1] KYOTO UNIV,FAC ENGN,DEPT APPL MATH & PHYS,KYOTO 606,JAPAN
来源：
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN | 1977年 / 20卷 / 01期
关键词：
D O I：
10.15807/jorsj.20.16
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：16 / 35
页数：20
相关论文
共 50 条
  • [1] Branch-and-bound algorithms on a hypercube
    Pargas, R.P.
    Wooster, D.E.
    [J]. Conference on Hypercube Concurrent Computers and Applications, 1988,
  • [2] AND/OR Branch-and-Bound on a Computational Grid
    Otten, Lars
    Dechter, Rina
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 59 : 351 - 435
  • [3] EXPECTED PERFORMANCE OF BRANCH-AND-BOUND ALGORITHMS
    LENSTRA, JK
    RINNOOYKAN, AHG
    [J]. OPERATIONS RESEARCH, 1978, 26 (02) : 347 - 349
  • [4] ANOMALIES IN PARALLEL BRANCH-AND-BOUND ALGORITHMS
    LAI, TH
    SAHNI, S
    [J]. COMMUNICATIONS OF THE ACM, 1984, 27 (06) : 594 - 602
  • [5] Quantum speedup of branch-and-bound algorithms
    Montanaro, Ashley
    [J]. PHYSICAL REVIEW RESEARCH, 2020, 2 (01):
  • [6] Learning to Search in Branch-and-Bound Algorithms
    He, He
    Daume, Hal, III
    Eisner, Jason
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 27 (NIPS 2014), 2014, 27
  • [7] PERFORMANCE OF PARALLEL BRANCH-AND-BOUND ALGORITHMS
    LAI, TH
    SPRAGUE, A
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (10) : 962 - 964
  • [8] A branch-and-bound inspired technique to improve the computational efficiency of DOA estimation
    Silva, H. V. L.
    Lemos, R. P.
    Ferreira, Y. R.
    Guedes, L. G. R.
    [J]. SIGNAL PROCESSING, 2013, 93 (04) : 947 - 956
  • [9] POWER OF DOMINANCE RELATIONS IN BRANCH-AND-BOUND ALGORITHMS
    IBARAKI, T
    [J]. JOURNAL OF THE ACM, 1977, 24 (02) : 264 - 279
  • [10] Probabilistic subproblem selection in branch-and-bound algorithms
    Dür, M
    Stix, V
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2005, 182 (01) : 67 - 80
12345