Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when? (Q3304189)
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 7228473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when? |
scientific article; zbMATH DE number 7228473 |
Statements
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? (English)
0 references
5 August 2020
0 references
reducing the search space
0 references
hybrid algorithms
0 references
0 references
0 references
0 references
0.8388890624046326
0 references
0.7424240708351135
0 references
0.7159838676452637
0 references
0.7032231688499451
0 references
0.6980842351913452
0 references
