User:Freemancw/Integer hull

The integer hull $$\mathrm{IH}(P)$$ of a convex polyhedron $$P$$ is the convex hull of all integer grid points inside $$P$$. Vertices of $$\mathrm{IH}(P)$$ represent optimal solutions to the integer program with contraints equal to the halfspaces defining $$P$$.


 * combinatorial complexity
 * fixed dimension
 * variable dimension
 * mediants
 * gcd
 * continued fractions
 * klein's sails
 * algorithms
 * computational complexity
 * lattice
 * integer programming
 * linear programming
 * optimization