activity
20092014
most citedAlgorithms for Highly Symmetric Linear and Integer Programs

55 citations · 94 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2014★ 2 cited

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…

math.MG2014★ 6 cited

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…

math.OC2012★ 19 cited

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…

math.OC2011★ 55 cited

Algorithms for Highly Symmetric Linear and Integer Programs

Richard Bödi, Katrin Herr, Michael Joswig

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 sym…

math.CO2009

Symmetries in Integer Programs

R. Bödi, K. Herr

The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric integer programs are studied from a group theoretical viewpoint. We investigate the st…

math.CO2009★ 12 cited

Symmetries in Linear and Integer Programs

R. Bödi, K. Herr

The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric linear and integer programs are studied from a group theoretical viewpoint. We show th…