An O(n) algorithm for quadratic knapsack problems (Q797501): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(84)90010-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978119584 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomially bounded algorithm for a singly constrained quadratic program / rank | |||
Normal rank | |||
Latest revision as of 12:37, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n) algorithm for quadratic knapsack problems |
scientific article |
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
