Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698)
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: Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem |
scientific article; zbMATH DE number 6188509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem |
scientific article; zbMATH DE number 6188509 |
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
0.91469693
0 references
0 references
0.8928385
0 references
0.88667065
0 references
0.8855427
0 references
0.88209105
0 references
0.8808601
0 references
