Approximating the min-max (regret) selecting items problem (Q1941689)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the min-max (regret) selecting items problem |
scientific article |
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
