Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299)
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: Integrating partial optimization with scatter search for solving bi-criteria 0, 1-knapsack problems |
scientific article; zbMATH DE number 5080311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems |
scientific article; zbMATH DE number 5080311 |
Statements
Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (English)
0 references
14 December 2006
0 references
metaheuristics
0 references
exact methods
0 references
scatter search
0 references
bi-criteria Knapsack
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0.9563019
0 references
0.9075896
0 references
0.88394636
0 references
0.87493336
0 references
0 references
0.8560264
0 references
0.8531787
0 references
