Lower bounds and a nearly fastest general parallel branch-and-bound algorithm

被引:0
|
作者
Wu, Jigang
Xie, Xing
Wan, Yingyu
Chen, Guoliang
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] Lower Bounds and a Nearly Fastest General Parallel Branch-and-Bound Algorithm
    Wu Jigang (Dept. of Computer Science
    Journal of Systems Engineering and Electronics, 2000, (03) : 65 - 73
  • [2] Lower bounds on the size of general branch-and-bound trees
    Dey, Santanu S.
    Dubey, Yatharth
    Molinaro, Marco
    MATHEMATICAL PROGRAMMING, 2023, 198 (01) : 539 - 559
  • [3] Lower bounds on the size of general branch-and-bound trees
    Santanu S. Dey
    Yatharth Dubey
    Marco Molinaro
    Mathematical Programming, 2023, 198 : 539 - 559
  • [4] Class of the efficient general parallel branch-and-bound algorithm
    Wu, Jigang
    Chen, Guoliang
    Xiaoxing Weixing Jisuanji Xitong/Mini-Micro Systems, 2000, 21 (11): : 1146 - 1149
  • [5] The Lower Bound on Complexity of Parallel Branch-And-Bound Algorithm for Subset Sum Problem
    Kolpakov, Roman
    Posypkin, Mikhail
    NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA-2016), 2016, 1776
  • [6] A RANDOMIZED PARALLEL BRANCH-AND-BOUND ALGORITHM
    JANAKIRAM, VK
    GEHRINGER, EF
    AGRAWAL, DP
    MEHROTRA, R
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1988, 17 (03) : 277 - 301
  • [7] Numerical experience with lower bounds for MIQP branch-and-bound
    Fletcher, R
    Leyffer, S
    SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (02) : 604 - 616
  • [8] Parallel branch-and-bound algorithm for a torus machine
    Kawaguchi, Tsuyoshi, 1600, (21):
  • [9] Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation
    Glaeser, Max
    Pfetsch, Marc E.
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 3747 - 3764
  • [10] The single machine earliness and tardiness scheduling problem: Lower bounds and a branch-and-bound algorithm
    Ronconi D.P.
    Kawamura M.S.
    Computational and Applied Mathematics, 2010, 29 (02) : 107 - 124