A note on optimal solutions to quadratic knapsack problems (Q614202)
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: A note on optimal solutions to quadratic knapsack problems |
scientific article; zbMATH DE number 5829531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on optimal solutions to quadratic knapsack problems |
scientific article; zbMATH DE number 5829531 |
Statements
A note on optimal solutions to quadratic knapsack problems (English)
0 references
27 December 2010
0 references
Summary: We report our success in applying \texttt{CPLEX}'s mixed integer quadratic programming solver to a set of standard quadratic knapsack test problems. The results we give show that this general purpose commercial code outperforms a leading special purpose method reported in the literature by a wide margin.
0 references
quadratic knapsack problem
0 references
optimisation
0 references
mixed integer quadratic programming
0 references
numerical examples
0 references
0.94429624
0 references
0 references
0.9318902
0 references
0.9318902
0 references
0 references
0.92566603
0 references
0.9247356
0 references
0.92243916
0 references
0.9221919
0 references
