Exact algorithm for bi-objective 0-1 knapsack problem (Q990717)
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: Exact algorithm for bi-objective 0-1 knapsack problem |
scientific article; zbMATH DE number 5777155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithm for bi-objective 0-1 knapsack problem |
scientific article; zbMATH DE number 5777155 |
Statements
Exact algorithm for bi-objective 0-1 knapsack problem (English)
0 references
1 September 2010
0 references
bi-objective 0-1 knapsack problem
0 references
multiple objective mathematical programming
0 references
linear programming
0 references
0 references
0 references
0 references
0.8611248135566711
0 references
0.8527344465255737
0 references
0.8404253721237183
0 references
0.8334837555885315
0 references
0.8217284679412842
0 references
