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 2010 · math.OCShow all

5 papers · 2 filters

math.OC2010★ 2 cited

Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three

Gennadiy Averkov, Christian Wagner, Robert Weismantel

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattic…

math.OC2010★ 2 cited

A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts (extended version)

Alberto Del Pia, Christian Wagner, Robert Weismantel

We consider mixed integer linear sets defined by two equations involving two integer variables and any number of non-negative continuous variables. The non-trivial valid inequaliti…

math.OC2010★ 1 cited

The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions

Jon Lee, Shmuel Onn, Lyubov Romanchuk +1

We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. W…

math.OC2010

Transversal numbers over subsets of linear spaces

Gennadiy Averkov, Robert Weismantel

Let be a subset of . It is an important question in the theory of linear inequalities to estimate the minimal number such that every system of linear ine…

math.OC2010

Intractability of approximate multi-dimensional nonlinear optimization on independence systems

Jon Lee, Shmuel Onn, Robert Weismantel

We consider optimization of nonlinear objective functions that balance linear criteria over -element independence systems presented by linear-optimization oracles. For …