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 条

[1] Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
R. M. Kolpakov
M. A. Posypkin
Journal of Computer and Systems Sciences International, 2011, 50 : 756 - 765
[2] On a Lower Bound on the Computational Complexity of a Parallel Implementation of the Branch-and-bound Method
Kolpakov, R. M.
Posypkin, M. A.
Sigal, I. Kh.
AUTOMATION AND REMOTE CONTROL, 2010, 71 (10) : 2152 - 2161
[3] On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
R. M. Kolpakov
M. A. Posypkin
I. Kh. Sigal
Automation and Remote Control, 2010, 71 : 2152 - 2161
[4] COMPUTATIONAL RESULTS WITH A BRANCH-AND-BOUND ALGORITHM FOR THE GENERAL KNAPSACK PROBLEM
BULFIN, RL
PARKER, RG
SHETTY, CM
NAVAL RESEARCH LOGISTICS, 1979, 26 (01) : 41 - 46
[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] On one approach to realization of the branch-and-bound method on a distributed system
Gulyaev A.V.
Makhnychev V.S.
Moscow University Computational Mathematics and Cybernetics, 2008, 32 (3) : 182 - 185
[7] A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 298 (01) : 89 - 98
[8] Branch-and-Bound and Dynamic Programming Approaches for the Knapsack Problem
Evgenii Burashnikov
Operations Research Forum, 5 (4)
[9] A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Bettinelli, Andrea
Cacchiani, Valentina
Malaguti, Enrico
INFORMS JOURNAL ON COMPUTING, 2017, 29 (03) : 457 - 473
[10] Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
Kolpakov, R. M.
Posypkin, M. A.
DISCRETE MATHEMATICS AND APPLICATIONS, 2010, 20 (01): : 95 - 112

← 1 2 3 4 5 →