Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem |
scientific article |
Statements
Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (English)
0 references
16 July 2013
0 references
0 references
