An O(n) algorithm for quadratic knapsack problems (Q797501)
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: An O(n) algorithm for quadratic knapsack problems |
scientific article; zbMATH DE number 3867076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(n) algorithm for quadratic knapsack problems |
scientific article; zbMATH DE number 3867076 |
Statements
An O(n) algorithm for quadratic knapsack problems (English)
0 references
1984
0 references
knapsack problem
0 references
bounded quadratic optimization
0 references
parametric approach
0 references
0.8385740518569946
0 references
0.8346964716911316
0 references
0.8271468877792358
0 references
0.8188340663909912
0 references
0.8164284229278564
0 references
