A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem (Q3768396)
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: A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem |
scientific article; zbMATH DE number 4026823
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem |
scientific article; zbMATH DE number 4026823 |
Statements
A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem (English)
0 references
1984
0 references
NP-completeness
0 references
linear search algorithm
0 references
n-dimensional knapsack problem
0 references
0.7940663695335388
0 references
0.7798960208892822
0 references
