2 papers
math.OC2014
Note on the Complexity of the Mixed-Integer Hull of a Polyhedron
Robert Hildebrand, Timm Oertel, Robert Weismantel
We study the complexity of computing the mixed-integer hull of a polyhedron . Given an inequality description, with on…
math.OC2014
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
Alberto Del Pia, Robert Hildebrand, Robert Weismantel +1
We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in . Previous work shows that optimizing a quad…