New algorithm for quadratic integer knapsack problems (Q2994046)
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: New algorithm for quadratic integer knapsack problems |
scientific article; zbMATH DE number 6612547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithm for quadratic integer knapsack problems |
scientific article; zbMATH DE number 6612547 |
Statements
10 August 2016
0 references
domination tuple
0 references
branch-and-bound
0 references
quadratic knapsack problem
0 references
integer programming
0 references
global optimization
0 references
0.8316770792007446
0 references
0.8280156254768372
0 references
0.8230116963386536
0 references
0.8156863451004028
0 references
0.8139200210571289
0 references
