R. Weismantel

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 2021Show all

3 papers · 1 filter

math.OC2021

Improving the Cook et al. Proximity Bound Given Integral Valued Constraints

Marcel Celaya, Stefan Kuhlmann, Joseph Paat +1

Consider a linear program of the form $max c^{⊤} x : A x \leq b$ , where $A$ is an $m \times n$ integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an op…

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 $Ax \leq b$ in terms of $Δ (A)$ , the maximal $n \times n$ minor in absolute value of $…

math.OC2021★ 5 cited

Notes on ${a, b, c}$ -Modular Matrices

Christoph Glanzer, Ingo Stallknecht, Robert Weismantel

Let $A \in Z^{m \times n}$ be an integral matrix and $a$ , $b$ , $c \in Z$ satisfy $a \geq b \geq c \geq 0$ . The question is to recognize whether $A$ is ${a, b, c}$ …

Improving the Cook et al. Proximity Bound Given Integral Valued Constraints

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

Notes on {a,b,c}-Modular Matrices

Notes on ${a, b, c}$ -Modular Matrices