Problem: Compute the integer hull and its facet description of a rational polyhedron

Given a rational polyhedron, compute conv(P ∩ Z^d) and enumerate its facets/vertices. Often relies on enumeration of lattice points and subsequent convex hull computations.

algorithmic task

MaRDI QIDQ6826115FDOCommunityMathAlgoDB

Specializations

Problem: Integer hull of Fibonacci knapsack polytopes

References

Computing convex hulls and counting integer points with polymake

Further links

Item	Property
Problem Class: Convex and integer-hull & lattice-point problems — master class	specialized by

---

---

Edit Problem: Compute the integer hull and its facet description of a rational polyhedron item

This page was built for task: Problem: Compute the integer hull and its facet description of a rational polyhedron