15 citations · 35 across the 7 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
math.CO2005★ 15 cited
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…
math.OC2005
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…