This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linearâ€¦ (More)

We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems, we introduce the new concept of core points, i.e.,â€¦ (More)

Themainpurpose of this paper is to report on the state of the art of computing integer hulls and their facets as well as counting lattice points in convex polytopes. Using the polymake system weâ€¦ (More)

Given a permutation group acting on coordinates of R, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called coreâ€¦ (More)