On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method (Q612225)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method |
scientific article; zbMATH DE number 5831184
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method |
scientific article; zbMATH DE number 5831184 |
Statements
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method (English)
0 references
3 January 2011
0 references
parallel complexity
0 references
branch-and-bound method for optimization problems
0 references
parallel complexity independent
0 references
Boolean knapsack problem
0 references
