65 citations · 253 across the 47 of their papers we have counts for
3 papers · 2 filters
Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations
Robert Hildebrand, Robert Weismantel, Rico Zenklusen
We prove that any mixed-integer linear extended formulation for the matching polytope of the complete graph on vertices, with a polynomial number of constraints, requires $Ω(\s…
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…
A Note on Non-Degenerate Integer Programs with Small Sub-Determinants
Stephan Artmann, Friedrich Eisenbrand, Christoph Glanzer +3
The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by and present an algorithm to solve s…