Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 489 / rank | |||
Normal rank | |||
Revision as of 22:38, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time |
scientific article |
Statements
Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (English)
0 references
21 July 2017
0 references
separable quadratic optimization
0 references
indefinite knapsack problems
0 references
lower and upper bounds
0 references
linear-time complexity
0 references
