Search papers, labs, and topics across Lattice.
1
0
1
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.
