Complexity and in-approximability of a selection problem in robust optimization (Q385465): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q207380 |
||
| Property / author | |||
| Property / author: Vladimir G. Deǐneko / rank | |||
Revision as of 21:45, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and in-approximability of a selection problem in robust optimization |
scientific article |
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
