Complexity results and exact algorithms for robust knapsack problems (Q2247901)
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 6309779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results and exact algorithms for robust knapsack problems |
scientific article; zbMATH DE number 6309779 |
Statements
Complexity results and exact algorithms for robust knapsack problems (English)
0 references
30 June 2014
0 references
knapsack problem
0 references
robustness
0 references
scenario-relaxation algorithm
0 references
NP-hardness
0 references
approximation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93659955
0 references
0.9273236
0 references
0.9273236
0 references
0.9243299
0 references
0.9223957
0 references
0.91462857
0 references
0.91412944
0 references
0.90782607
0 references
0.9059133
0 references
