No label defined (Q4550768)
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 1795719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1795719 |
Statements
2002
0 references
quadratic knapsack problem
0 references
\(x^TQx\)
0 references
0.8019312024116516
0 references
0.8011802434921265
0 references
0.7950673699378967
0 references
0.7940581440925598
0 references
0.7880658507347107
0 references
The problem is to \(\max x^TQx\), s.t. \(Ax\leq b\), \(x_i\in\{0,1\}\) where all coefficients of \(A\) are non-negative and those of \(b\) are all positive. In this paper \(A\) is assumed to be a single row vector and the problem is reformulated as an unconstrained binary quadratic program. This is then solved by a recently developed heuristic method. A lot of computational experiments are given. For the entire collection see [Zbl 0988.00046].
0 references
