Approximating the min-max (regret) selecting items problem (Q1941689)
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: Approximating the min-max (regret) selecting items problem |
scientific article; zbMATH DE number 6147759
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the min-max (regret) selecting items problem |
scientific article; zbMATH DE number 6147759 |
Statements
Approximating the min-max (regret) selecting items problem (English)
0 references
21 March 2013
0 references
robust optimization
0 references
combinatorial problems
0 references
approximation algorithms
0 references
computational complexity
0 references
min-max regret
0 references
0.91185135
0 references
0.90955865
0 references
0.8964431
0 references
0.8933639
0 references
0 references
0.8893395
0 references
0.8831138
0 references
0.88247424
0 references
0.8817655
0 references
0.8806682
0 references
