An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6619161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient global algorithm for a class of indefinite separable quadratic programs |
scientific article; zbMATH DE number 6619161 |
Statements
An efficient global algorithm for a class of indefinite separable quadratic programs (English)
0 references
25 August 2016
0 references
separable quadratic programs
0 references
indefinite knapsack problems
0 references
global optimization
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0.8356459736824036
0 references
0.8049651384353638
0 references
0.7955465912818909
0 references
0.7933365106582642
0 references
0.7855145335197449
0 references
