Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (Q1652447)
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: Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems |
scientific article; zbMATH DE number 6901501
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems |
scientific article; zbMATH DE number 6901501 |
Statements
Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (English)
0 references
11 July 2018
0 references
multi-objective optimization
0 references
implicit enumeration techniques
0 references
0 references
