A local-search-based heuristic for the demand-constrained multidimensional knapsack problem (Q2890459)
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 local-search-based heuristic for the demand-constrained multidimensional knapsack problem |
scientific article; zbMATH DE number 6044601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local-search-based heuristic for the demand-constrained multidimensional knapsack problem |
scientific article; zbMATH DE number 6044601 |
Statements
8 June 2012
0 references
integer programming
0 references
heuristic algorithms
0 references
multidimensional knapsack
0 references
0.9094355
0 references
0.90342396
0 references
0.8961975
0 references
0 references
0.89399433
0 references
0.89399433
0 references
0.89245963
0 references
A local-search-based heuristic for the demand-constrained multidimensional knapsack problem (English)
0 references
