6 citations · 8 across the 2 of their papers we have counts for
4 papers
Computing convex hulls and counting integer points with polymake
Benjamin Assarf, Ewgenij Gawrilow, Katrin Herr +4
The main purpose 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 po…
On Lattice-Free Orbit Polytopes
Katrin Herr, Thomas Rehn, Achill Schürmann
Given a permutation group acting on coordinates of , we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of s…
Computing symmetry groups of polyhedra
David Bremner, Mathieu Dutour Sikiric, Dmitrii V. Pasechnik +2
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups…
Exploiting Symmetry in Integer Convex Optimization using Core Points
Katrin Herr, Thomas Rehn, Achill Schürmann
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 co…