Universität Rostock, 2014
Abstract: This thesis studies minimal lattice-free symmetric polytopes. Lattice-free means that the only integral points in the polytope are its vertices. Symmetric in context of the thesis means that all vertices lie in one single orbit under a group action. The thesis focuses on groups that are permutation groups acting on R^n by permuting coordinates. If a symmetric polytope is lattice-free, its vertices are called core points. Methods to construct core points and applications in symmetric integer linear programming are explored.
doctoral thesis free access