Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method |
scientific article |
Statements
Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (English)
0 references
8 January 2021
0 references
branch-and-bound method
0 references
parallel computational complexity
0 references
subset sum problem
0 references
