Branch-and-bound algorithms on a hypercube

被引:1
|
作者
Pargas, R.P.
Wooster, D.E.
机构
关键词
D O I
10.1145/63047.63109
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [31] Dual bounding procedures lead to convergent Branch-and-Bound algorithms
    Dür, M
    MATHEMATICAL PROGRAMMING, 2001, 91 (01) : 117 - 125
  • [32] Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization
    Samain, Gwenael
    Ninin, Jordan
    Bourguignon, Sebastien
    OPTIMIZATION METHODS & SOFTWARE, 2024, 40 (01): : 4 - 41
  • [33] Control schemes in a generalized utility for parallel branch-and-bound algorithms
    Shinano, Y
    Harada, K
    Hirabayashi, R
    11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, : 621 - 627
  • [34] Generative Adversarial Imitation Learning to Search in Branch-and-Bound Algorithms
    Wang, Qi
    Blackley, Suzanne, V
    Tang, Chunlei
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, DASFAA 2022, PT II, 2022, : 673 - 680
  • [35] Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
    Phan, Dzung T.
    OPERATIONS RESEARCH, 2012, 60 (02) : 275 - 285
  • [36] CHARACTERIZATION AND THEORETICAL COMPARISON OF BRANCH-AND-BOUND ALGORITHMS FOR PERMUTATION PROBLEMS
    KOHLER, WH
    STEIGLIT.K
    JOURNAL OF THE ACM, 1974, 21 (01) : 140 - 156
  • [37] Dual bounding procedures lead to convergent Branch-and-Bound algorithms
    Dür M.
    Mathematical Programming, 2001, 91 (1) : 117 - 125
  • [38] Branch-and-bound algorithms for simple assembly line balancing problem
    Liu, S. B.
    Ng, K. M.
    Ong, H. L.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 36 (1-2): : 169 - 177
  • [39] A quantitative evaluation of limited-memory branch-and-bound algorithms
    Mahapatra, NR
    Covelli, DE
    Beres, Y
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL I AND II, 1999, : 84 - 90
  • [40] RANDOMIZED PARALLEL ALGORITHMS FOR BACKTRACK SEARCH AND BRANCH-AND-BOUND COMPUTATION
    KARP, RM
    ZHANG, YJ
    JOURNAL OF THE ACM, 1993, 40 (03) : 765 - 789