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 math.COShow all

6 papers · 1 filter

math.CO2021

On lattice width of lattice-free polyhedra and height of Hilbert bases

Martin Henk, Stefan Kuhlmann, Robert Weismantel

We study the lattice width of lattice-free polyhedra given by in terms of , the maximal minor in absolute value of $…

math.CO2009

Multicommodity Flow in Polynomial Time

Raymond Hemmecke, Shmuel Onn, Robert Weismantel

The multicommodity flow problem is NP-hard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of n-fold integer programming and extensions deve…

math.CO2008★ 6 cited

Nonlinear optimization for matroid intersection and extensions

Yael Berstein, Jon Lee, Shmuel Onn +1

We address optimization of nonlinear functions of the form , where is a nonlinear function, is a matrix, and feasible are in some large fi…

math.CO2008★ 7 cited

Nonlinear Optimization over a Weighted Independence System

Jon Lee, Shmuel Onn, Robert Weismantel

We consider the problem of optimizing a nonlinear objective function over a weighted independence system presented by a linear-optimization oracle. We provide a polynomial-time alg…

math.CO2007

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…

math.CO2006

Convex Integer Maximization via Graver Bases

J. De Loera, R. Hemmecke, S. Onn +2

We present a new algebraic algorithmic scheme to solve {\em convex integer maximization} problems of the following form, where is a convex function on and …