activity
20042026
most citedA polynomial oracle-time algorithm for convex integer minimization

65 citations · 253 across the 47 of their papers we have counts for

collaborators
Showing 2004Show all

2 papers · 1 filter

math.OC2004

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…

math.OC2004★ 57 cited

Integer Polynomial Optimization in Fixed Dimension

Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe +1

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the…