On the complexity of computing the volume of a polyhedron

For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of the incidence vectors of all nonempty edge cutsets of G. We give some properties of the facial structure of cut(G). In particular, we characterize all ...

Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with certain ...

We study the complexity of computing the mixed-integer hull conv ( P ( Z n í R d ) ) of a polyhedron P . Given an inequality description, with one integer variable, the mixed-integer hull can have exponentially many vertices and facets in d . For n , d ...