Complexity and in-approximability of a selection problem in robust optimization (Q385465): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10288-012-0227-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029243025 / rank | |||
Normal rank | |||
Revision as of 18:18, 19 March 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
