267 citations · 705 across the 11 of their papers we have counts for
1 paper · 2 filters
Vasil S. Denchev, Nan Ding, Shin Matsushima +2
We propose a totally corrective boosting algorithm with explicit cardinality regularization. The resulting combinatorial optimization problems are not known to be efficiently solva…