Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem

Authors:
R. M. Kolpakov;M. A. Posypkin
Affiliations:
Moscow State University, Leninskie Gory, Moscow, Russia 119992;Moscow State University, Leninskie Gory, Moscow, Russia 119992
Venue:
Journal of Computer and Systems Sciences International
Year:
2011

Citing 2
Cited 0

Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions

Journal of Computer and Systems Sciences International
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.