Solving efficiently the 0-1 multi-objective knapsack problem (Q947962)
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 5349747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving efficiently the 0-1 multi-objective knapsack problem |
scientific article; zbMATH DE number 5349747 |
Statements
Solving efficiently the 0-1 multi-objective knapsack problem (English)
0 references
8 October 2008
0 references
non-dominated criterion vectors
0 references
efficient solutions
0 references
dynamic programming
0 references
dominance relations
0 references
0 references
0 references
0 references
0 references
0.980805277824402
0 references
0.868276834487915
0 references
0.8519687652587891
0 references
0.8488724827766418
0 references
0.8436430096626282
0 references
