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 条

[21] A BRANCH-AND-BOUND METHOD FOR THE FIXED CHARGE TRANSPORTATION PROBLEM
PALEKAR, US
KARWAN, MH
ZIONTS, S
MANAGEMENT SCIENCE, 1990, 36 (09) : 1092 - 1105
[22] A Branch-and-Bound Method for the Multichromosomal Reversal Median Problem
Zhang, Meng
Arndt, William
Tang, Jijun
ALGORITHMS IN BIOINFORMATICS, WABI 2008, 2008, 5251 : 14 - +
[23] SET PARTITIONING PROBLEM - BRANCH-AND-BOUND METHOD TRUNCATION
DELORME, J
HEURGON, E
REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1975, (NV2): : 53 - 65
[24] The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
Shaw, DX
Cho, G
NETWORKS, 1998, 31 (04) : 205 - 216
[25] Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem
Kolpakov, Roman
Posypkin, Mikhail
OPEN COMPUTER SCIENCE, 2020, 11 (01) : 116 - 126
[26] THE TRAVELLING SALESMAN PROBLEM: IMPROVED LOWER BOUND IN THE BRANCH-AND-BOUND METHOD
Kostyuk, Y. L.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 22 (04): : 73 - +
[27] Solving Knapsack Problem: Postoptimality Analysis and Branch and Bound Method
Mikhailyuk, V. A.
JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2011, 43 (11) : 48 - 56
[28] Parallel branch-and-bound methods for thejob-shop scheduling problem
Michael Perregaard
Jens Clausen
Annals of Operations Research, 1998, 83 : 137 - 160
[29] APPLICATION OF METHOD BRANCH AND BOUND FOR A GENERALIZED KNAPSACK-PROBLEM
KRAWCZYK, R
ANGEWANDTE INFORMATIK, 1971, 13 (10): : 461 - &
[30] 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

← 1 2 3 4 5 →