Geodesic
On а recursive-parallel algorithm for solving the Knapsack Problem
Modelirovanie i analiz informacionnyh sistem, Tome 25 (2018) no. 2, pp. 155-164

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper, we offer an efficient parallel algorithm for solving the NP-complete Knapsack Problem in its basic, so-called 0-1 variant. To find its exact solution, algorithms belonging to the category "branch and bound methods” have long been used. To speed up the solving with varying degrees of efficiency, various options for parallelizing computations are also used. We propose here an algorithm for solving the problem, based on the paradigm of recursive-parallel computations. We consider it suited well for problems of this kind, when it is difficult to immediately break up the computations into a sufficient number of subtasks that are comparable in complexity, since they appear dynamically at run time. We used the RPM ParLib library, developed by the author, as the main tool to program the algorithm. This library allows us to develop effective applications for parallel computing on a local network in the .NET Framework. Such applications have the ability to generate parallel branches of computation directly during program execution and dynamically redistribute work between computing modules. Any language with support for the .NET Framework can be used as a programming language in conjunction with this library. For our experiments, we developed some C# applications using this library. The main purpose of these experiments was to study the acceleration achieved by recursive-parallel computing. A detailed description of the algorithm and its testing, as well as the results obtained, are also given in the paper.
Keywords: Knapsack Problem, parallel algorithm, recursion
Mots-clés : .NET. 
@article{MAIS_2018_25_2_a0,
     author = {V. V. Vasilchikov},
     title = {On {\cyra} recursive-parallel algorithm for solving the {Knapsack} {Problem}},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {155--164},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2018_25_2_a0/}
}
TY  - JOUR
AU  - V. V. Vasilchikov
TI  - On а recursive-parallel algorithm for solving the Knapsack Problem
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2018
SP  - 155
EP  - 164
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2018_25_2_a0/
LA  - ru
ID  - MAIS_2018_25_2_a0
ER  - 
%0 Journal Article
%A V. V. Vasilchikov
%T On а recursive-parallel algorithm for solving the Knapsack Problem
%J Modelirovanie i analiz informacionnyh sistem
%D 2018
%P 155-164
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2018_25_2_a0/
%G ru
%F MAIS_2018_25_2_a0
V. V. Vasilchikov. On а recursive-parallel algorithm for solving the Knapsack Problem. Modelirovanie i analiz informacionnyh sistem, Tome 25 (2018) no. 2, pp. 155-164. http://geodesic.mathdoc.fr/item/MAIS_2018_25_2_a0/