Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263)
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: Linear programming for the 0-1 quadratic knapsack problem |
scientific article; zbMATH DE number 1212243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear programming for the \(0-1\) quadratic knapsack problem |
scientific article; zbMATH DE number 1212243 |
Statements
Linear programming for the \(0-1\) quadratic knapsack problem (English)
0 references
1996
0 references
quadratic knapsack problem
0 references
positive quadratic pseudo-Boolean function
0 references
linear capacity constraint
0 references
branch-and-bound
0 references
0 references
0 references
0.9149826169013976
0 references
0.9059171676635742
0 references
0.8826461434364319
0 references
0.8743725419044495
0 references
