Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890)
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: Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems |
scientific article; zbMATH DE number 6088478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems |
scientific article; zbMATH DE number 6088478 |
Statements
Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (English)
0 references
30 September 2012
0 references
multi-objective optimization
0 references
bi-objective knapsack problem
0 references
dynamic programming
0 references
basic state reduction techniques
0 references
0 references
0 references
0 references
0 references
0.9447813034057616
0 references
0.849901556968689
0 references
0.821331799030304
0 references
0.8117359280586243
0 references
0.8076711893081665
0 references
