Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/dma-2020-0028 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3097297855 / rank | |||
Normal rank | |||
Revision as of 23:02, 19 March 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
