Efficient Methods For Solving Quadratic 0–1 Knapsack Problems (Q4372880)
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: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems |
scientific article; zbMATH DE number 1097710
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Methods For Solving Quadratic 0–1 Knapsack Problems |
scientific article; zbMATH DE number 1097710 |
Statements
Efficient Methods For Solving Quadratic 0–1 Knapsack Problems (English)
0 references
8 June 1998
0 references
\(L_ 2\)-best linear approximation
0 references
heuristic
0 references
branch and bound
0 references
linear inequality
0 references
0.8826461434364319
0 references
0.875847578048706
0 references
0.8486446142196655
0 references
0.845844566822052
0 references
