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 the normal view instead:
scientific article; zbMATH DE number 7291226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method |
scientific article; zbMATH DE number 7291226 |
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
0 references
0.8476841449737549
0 references
0.8313215970993042
0 references
0.788859486579895
0 references
0.7809747457504272
0 references
