1 citations · 2 across the 4 of their papers we have counts for
1 paper · 1 filter
Shmuel Onn, Uriel G. Rothblum
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly pol…