Nalaganje...
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...
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Yaroslavl State University
2018-04-01
|
| Serija: | Modelirovanie i Analiz Informacionnyh Sistem |
| Teme: | |
| Online dostop: | https://www.mais-journal.ru/jour/article/view/676 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|