65 citations · 313 across the 28 of their papers we have counts for
5 papers · 1 filter
A polynomial oracle-time algorithm for convex integer minimization
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
In this paper we consider the solution of certain convex integer minimization problems via greedy augmentation procedures. We show that a greedy augmentation procedure that employs…
On the Gröbner complexity of matrices
Raymond Hemmecke, Kristen A. Nairn
In this paper we show that if for an integer matrix A the universal Gröbner basis of the associated toric ideal \Ideal_A coincides with the Graver basis of A, then the Gröbner comp…
Pareto Optima of Multicriteria Integer Linear Programs
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
We settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space…
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe +1
We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, w…
Computation of Atomic Fibers of Z-Linear Maps
Elke Eisenschmidt, Raymond Hemmecke, Matthias Köppe
For given matrix , the set describes the preimage or fiber of under the -linear map , $x\mapsto…