A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116)
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: A matheuristic for the 0--1 generalized quadratic multiple knapsack problem |
scientific article; zbMATH DE number 7461739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A matheuristic for the 0--1 generalized quadratic multiple knapsack problem |
scientific article; zbMATH DE number 7461739 |
Statements
A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (English)
0 references
21 January 2022
0 references
generalized quadratic knapsack problem
0 references
linearization
0 references
matheuristic
0 references
variable neighborhood search
0 references
integer programing
0 references
0 references
0 references
0 references
0 references
0.8212491273880005
0 references
0.8001042604446411
0 references
0.7992738485336304
0 references
0.7966846227645874
0 references
0.7860613465309143
0 references
