Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:43, 2 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
