Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188)
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: Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem |
scientific article; zbMATH DE number 6654095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem |
scientific article; zbMATH DE number 6654095 |
Statements
Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (English)
0 references
17 November 2016
0 references
tabu search
0 references
the quadratic multiple knapsack problem
0 references
infeasible local search
0 references
0 references
0 references
0.7929099798202515
0 references
0.7924919724464417
0 references
0.7778649926185608
0 references
0.7777263522148132
0 references
