1 research outputs found
Note on the Complexity of the Mixed-Integer Hull of a Polyhedron
We study the complexity of computing the mixed-integer hull
of a polyhedron .
Given an inequality description, with one integer variable, the mixed-integer
hull can have exponentially many vertices and facets in . For fixed,
we give an algorithm to find the mixed integer hull in polynomial time. Given
and fixed, we compute a vertex description of
the mixed-integer hull in polynomial time and give bounds on the number of
vertices of the mixed integer hull