Buse Şen

A branch-and-bound algorithm tailored to the resulting robust sparse portfolio problems is developed, together with a new pruning rule that can discard exponentially many candidate portfolios in a single step.

Escaping the curse of dimensionality in multistage stochastic optimization is now possible: multilevel Monte Carlo methods can reduce scenario complexity from exponential to polynomial.