Login / Signup
Complexity and in-approximability of a selection problem in robust optimization.
Vladimir G. Deineko
Gerhard J. Woeginger
Published in:
4OR (2013)
Keyphrases
</>
robust optimization
chance constrained
stochastic programming
portfolio optimization
worst case
mathematical programming
risk measures
decision problems
cooperative
computational complexity
probability distribution
search algorithm