most citedComputing The Extension Complexities of All 4-Dimensional 0/1-Polytopes

5 citations · 6 across the 3 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2016

Optimality certificates for convex minimization and Helly numbers

Amitabh Basu, Michele Conforti, Gérard Cornuéjols +2

We consider the problem of minimizing a convex function over a subset of R^n that is not necessarily convex (minimization of a convex function over the integer points in a polytope…