65 citations · 253 across the 47 of their papers we have counts for
3 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…
Nonlinear Matroid Optimization and Experimental Design
Yael Berstein, Jon Lee, Hugo Maruri-Aguilar +4
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-crite…
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…