Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1515/DMA-2020-0028 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1515/DMA-2020-0028 / rank | |||
Normal rank | |||
Latest revision as of 04:21, 10 December 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
0 references
