On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study (Q1876139)
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: On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study |
scientific article; zbMATH DE number 2091648
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study |
scientific article; zbMATH DE number 2091648 |
Statements
On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study (English)
0 references
16 August 2004
0 references
Multiple objective programming
0 references
Combinatorial optimization
0 references
Metaheuristics
0 references
0 references
0 references
0 references
0 references
