On а Recursive-Parallel Algorithm for Solving the Knapsack Problem

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 e...

Full description

Saved in:
Bibliographic Details
Main Author: Vladimir V. Vasilchikov
Format: Artigo
Language:Inglês
Published: Yaroslavl State University 2018-04-01
Series:Modelirovanie i Analiz Informacionnyh Sistem
Subjects:
knapsack problem
parallel algorithm
recursion
.net
Online Access:https://www.mais-journal.ru/jour/article/view/676
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items