The lexicographic \(\alpha \)-robust knapsack problem (Q3087844)
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 5939897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The lexicographic \(\alpha \)-robust knapsack problem |
scientific article; zbMATH DE number 5939897 |
Statements
The lexicographic α-robust knapsack problem (English)
0 references
17 August 2011
0 references
uncertainty
0 references
robustness
0 references
0-1 knapsack problem
0 references
min-max (regret)
0 references
complexity
0 references
0 references
0.827633261680603
0 references
0.8237279057502747
0 references
0.8233580589294434
0 references
0.8201313614845276
0 references
0.809842586517334
0 references
