A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173)
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 7344541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs |
scientific article; zbMATH DE number 7344541 |
Statements
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (English)
0 references
5 May 2021
0 references
descent
0 references
heuristic
0 references
knapsack
0 references
optimization
0 references
0 references
0 references
0 references
0.8875053
0 references
0.86961114
0 references
0.86137795
0 references
0.8597495
0 references
0.85486525
0 references
0.85421777
0 references
0.85301894
0 references
0.85275155
0 references
0.8524239
0 references
