Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490)
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: Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time |
scientific article; zbMATH DE number 6751025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time |
scientific article; zbMATH DE number 6751025 |
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
0 references
0 references
0 references
0.8356459736824036
0 references
0.7755328416824341
0 references
0.7635790705680847
0 references
0.7634093165397644
0 references
