15 citations · 29 across the 6 of their papers we have counts for
8 papers
Computing generating sets of lattice ideals
Raymond Hemmecke, Peter Malkin
In this article, we present a new algorithm for computing a generating set of a lattice ideal. This algorithm is based on a project-and-lift approach and is implemented in 4ti2. We…
Finiteness theorems in stochastic integer programming
Matthias Aschenbrenner, Raymond Hemmecke
We study Graver test sets for families of linear multi-stage stochastic integer programs with varying number of scenarios. We show that these test sets can be decomposed into finit…
Exploiting Symmetries in the Computation of Graver Bases
Raymond Hemmecke
Many challenging Graver bases computations, like for multi-way tables in statistics, have a highly symmetric problem structure that is not exploited so far computationally. In this…
Integral Function Bases
Raymond Hemmecke, Robert Weismantel
Integral bases, a minimal set of solutions to that generate any other solution to , as a nonnegative integer linear combination, are always…
Test Sets for Integer Programs with Z-Convex Objective
Raymond Hemmecke
In this paper we extend test set based augmentation methods for integer linear programs to programs with more general convex objective functions. We show existence and computabilit…
Short Rational Functions for Toric Algebra and Applications
Jesus De Loera, David Haws, Raymond Hemmecke +3
We encode the binomials belonging to the toric ideal associated with an integral matrix using a short sum of rational functions as introduced by Barvinok \ci…