A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem (Q3527261)
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 Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem |
scientific article; zbMATH DE number 5347492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem |
scientific article; zbMATH DE number 5347492 |
Statements
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem (English)
0 references
25 September 2008
0 references
multi-objective knapsack problem
0 references
approximation
0 references
dynamic programming
0 references
dominance relations
0 references
combinatorial optimization
0 references
0.9729824066162108
0 references
0.8715898990631104
0 references
0.868276834487915
0 references
0.8141704201698303
0 references
