A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206)
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 two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem |
scientific article; zbMATH DE number 6008580
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem |
scientific article; zbMATH DE number 6008580 |
Statements
A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (English)
0 references
21 February 2012
0 references
bi-objective knapsack instances
0 references
multi-objective optimization
0 references
dynamic programming
0 references
state reduction
0 references
0 references
0.9410566
0 references
0 references
0.9159206
0 references
0.89330876
0 references
0.89195895
0 references
0 references
0.8738036
0 references
0.8712792
0 references
