載入...
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...
Na minha lista:
| 主要作者: | |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Yaroslavl State University
2018-04-01
|
| 叢編: | Modelirovanie i Analiz Informacionnyh Sistem |
| 主題: | |
| 在線閱讀: | https://www.mais-journal.ru/jour/article/view/676 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|