Approximate algorithms for the Knapsack problem on parallel computers (Q757041)
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: Approximate algorithms for the Knapsack problem on parallel computers |
scientific article; zbMATH DE number 4193111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate algorithms for the Knapsack problem on parallel computers |
scientific article; zbMATH DE number 4193111 |
Statements
Approximate algorithms for the Knapsack problem on parallel computers (English)
0 references
1991
0 references
parallel algorithm
0 references
knapsack problem
0 references
0.9564822
0 references
0.9520631
0 references
0.94172513
0 references
0 references
0.93303156
0 references
0.93099976
0 references
