  We propose a cut-based algorithm for finding all vertices and all facets of
the convex hull of all integer points of a polyhedron defined by a system of
linear inequalities. Our algorithm DDM Cuts is based on the Gomory cuts and the
dynamic version of the double description method. We describe the computer
implementation of the algorithm and present the results of computational
experiments comparing our algorithm with a naive one.
