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... View More