Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Roman M. Kolpakov / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6188509 / rank | |||
Normal rank | |||
Revision as of 08:58, 28 June 2023
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
