Estimating the Computational Complexity of One Variant of Parallel Realization of the Branch-and-Bound Method for the Knapsack Problem

被引：5
|
作者：
Kolpakov, R. M. [1 ]
Posypkin, M. A.
机构：
[1] Moscow MV Lomonosov State Univ, Moscow 119992, Russia
来源：
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL | 2011年 / 50卷 / 05期
基金：
俄罗斯基础研究基金会;
关键词：
OBJECTIVE FUNCTIONS; OPTIMIZATION; VALUES;
D O I：
10.1134/S106423071105011X
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
One of the possible realizations of the branch-and-bound method on multiprocessor systems with distributed memory, the front-end algorithm is addressed. The complexity of the front-end algorithm is studied for a family of Boolean knapsack problems with one constraint under the assumption that the number of processors is not limited. Formulas for the order of complexity growth with an increase in dimension of the problems from the addressed family are obtained for the front-end algorithm. The asymptotic acceleration behavior and efficiency of resource use with an increase in the number of variables are studied. DOI: 10.1134/S106423071105011X
引用
收藏
页码：756 / 765
页数：10
相关论文
共 50 条
  • [31] A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem
    Bak, Slawomir
    Blazewicz, Jacek
    Pawlak, Grzegorz
    Plaza, Maciej
    Burke, Edmund K.
    Kendall, Graham
    INFORMS JOURNAL ON COMPUTING, 2011, 23 (01) : 15 - 25
  • [32] Parallel branch-and-bound methods for the job-shop scheduling problem
    Perregaard, M
    Clausen, J
    ANNALS OF OPERATIONS RESEARCH, 1998, 83 (0) : 137 - 160
  • [33] A parallel P2P Branch-and-Bound algorithm for computational Grids
    Bendjoudi, Ahcene
    Melab, Nouredine
    Talbi, El-Ghazali
    CCGrid 2007: Seventh IEEE International Symposium on Cluster Computing and the Grid, 2007, : 749 - 754
  • [34] Solving the Multiscenario Max-Min Knapsack Problem Exactly with Column Generation and Branch-and-Bound
    Pinto, Telmo
    Alves, Claudio
    Mansi, Raid
    de Carvalho, Jose Valerio
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [35] THE MANY-COMMODITY LOCATION PROBLEM (THE BRANCH-AND-BOUND METHOD)
    DAVYDOVA, IM
    ROMANOVSKII, IV
    CYBERNETICS, 1983, 19 (05): : 681 - 686
  • [36] A NOTE ON ANOMALIES IN PARALLEL BRANCH-AND-BOUND ALGORITHMS WITH ONE-TO-ONE BOUNDING FUNCTIONS
    LAI, TH
    SPRAGUE, A
    INFORMATION PROCESSING LETTERS, 1986, 23 (03) : 119 - 122
  • [37] Speedup estimates for some variants of the parallel implementations of the branch-and-bound method
    Posypkin M.A.
    Sigal I.Kh.
    Computational Mathematics and Mathematical Physics, 2006, 46 (12) : 2187 - 2202
  • [38] Comparison of Parallel Implementations of the Branch-and-Bound Method for Shared Memory Systems
    Gorchakov, A. Yu.
    Posypkin, M. A.
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2023, 62 (02) : 248 - 262
  • [39] Comparison of Parallel Implementations of the Branch-and-Bound Method for Shared Memory Systems
    A. Yu. Gorchakov
    M. A. Posypkin
    Journal of Computer and Systems Sciences International, 2023, 62 : 248 - 262
  • [40] Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server
    Liu, Guo-Sheng
    Li, Jin-Jin
    Yang, Hai-Dong
    Huang, George Q.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2019, 70 (09) : 1554 - 1570
12345