Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:42, 30 January 2024
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
