Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5571491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implementing an efficient fptas for the 0-1 multi-objective knapsack problem |
scientific article; zbMATH DE number 5571491 |
Statements
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (English)
0 references
30 June 2009
0 references
multi-objective knapsack problem
0 references
approximation
0 references
dynamic programming
0 references
dominance relations
0 references
combinatorial optimization
0 references
0 references
0.9729824066162108
0 references
0.8655511736869812
0 references
0.8519687652587891
0 references
0.8300472497940063
0 references
