Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4821303 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the best choice of a branching variable in the subset sum problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tight Bounds for On-Line Tree Embeddings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deterministic parallel backtrack search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Randomized parallel algorithms for backtrack search and branch-and-bound computation / rank | |||
Normal rank | |||
Revision as of 06:46, 24 July 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
