Thomas Rehn

Learn More
A. Given a permutation group acting on coordinates of R n , 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 points and they play a key role in a recent approach to exploit symmetry in integer convex optimization problems. Here, naturally the question arises, for(More)
AAAAAA. The handling of symmetries in mixed integer programs in order to speed up the solution process of branch-and-cut solvers has recently received signiicant attention, both in theory and practice. This paper compares diierent methods for handling symmetries using a common implementation framework. We start by investigating the computation of symmetries(More)
  • 1