1 paper
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…