A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation (Q702759)
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 scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation |
scientific article; zbMATH DE number 2128895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation |
scientific article; zbMATH DE number 2128895 |
Statements
A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation (English)
0 references
17 January 2005
0 references
Meta-heuristics
0 references
multidimensional knapsack problem
0 references
scatter search method
0 references
surrogate relaxation
0 references
combinatorial optimization
0 references
