Multicriteria 0-1 knapsack problems with \(k\)-min objectives (Q502471)
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: Multicriteria 0-1 knapsack problems with k-min objectives |
scientific article; zbMATH DE number 6670635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multicriteria 0-1 knapsack problems with \(k\)-min objectives |
scientific article; zbMATH DE number 6670635 |
Statements
Multicriteria 0-1 knapsack problems with \(k\)-min objectives (English)
0 references
5 January 2017
0 references
multiple objective optimization
0 references
\(k\)-min objectives
0 references
multidimensional knapsack problem
0 references
hybrid approaches
0 references
0.93359685
0 references
0.9246448
0 references
0.9194217
0 references
0.9172587
0 references
0.9146674
0 references
0.91371393
0 references
0 references
0.9094236
0 references
