Complexity and in-approximability of a selection problem in robust optimization (Q385465)
From MaRDI portal
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