Complexity and in-approximability of a selection problem in robust optimization (Q385465)
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: Complexity and in-approximability of a selection problem in robust optimization |
scientific article; zbMATH DE number 6235151
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and in-approximability of a selection problem in robust optimization |
scientific article; zbMATH DE number 6235151 |
Statements
Complexity and in-approximability of a selection problem in robust optimization (English)
0 references
2 December 2013
0 references
combinatorial optimization
0 references
computational complexity
0 references
robust optimization
0 references
NP-hardness
0 references
inapproximability
0 references
0.89161813
0 references
0.88507587
0 references
0.8844895
0 references
0.8770018
0 references
0.8741872
0 references
