Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658)
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 5223705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breakpoint searching algorithms for the continuous quadratic knapsack problem |
scientific article; zbMATH DE number 5223705 |
Statements
Breakpoint searching algorithms for the continuous quadratic knapsack problem (English)
0 references
7 January 2008
0 references
Nonlinear programming
0 references
Convex programming
0 references
Quadratic programming
0 references
Separable programming
0 references
Singly constrained quadratic program
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8792890906333923
0 references
0.8367763161659241
0 references
0.7992967963218689
0 references
0.794206440448761
0 references
