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

3 papers

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…

math.CO2014★ 5 cited

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

Michael Oelze, Arnaud Vandaele, Stefan Weltge

We present slight refinements of known general lower and upper bounds on sizes of extended formulations for polytopes. With these observations we are able to compute the extension…

math.CO2014★ 1 cited

Hidden Vertices in Extensions of Polytopes

Kanstantsin Pashkovich, Stefan Weltge

Some widely known compact extended formulations have the property that each vertex of the corresponding extension polytope is projected onto a vertex of the target polytope. In thi…