Stefan Weltge

activity

20132026

most citedA Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially

31 citations · 56 across the 21 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Lattice-free simplices with lattice width $2 d - o (d)$

Lukas Mayrhofer, Jamico Schade, Stefan Weltge

The Flatness theorem states that the maximum lattice width $Flt (d)$ of a $d$ -dimensional lattice-free convex set is finite. It is the key ingredient for Lenstra's algorithm f…

cs.DM2021

Lifts for Voronoi cells of lattices

Matthias Schymura, Ina Seidel, Stefan Weltge

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed represent…

math.CO2021★ 1 cited

Integer programs with bounded subdeterminants and two nonzeros per row

Samuel Fiorini, Gwenaël Joret, Stefan Weltge +1

We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at…

Lattice-free simplices with lattice width 2d−o(d)

Lifts for Voronoi cells of lattices

Integer programs with bounded subdeterminants and two nonzeros per row

Lattice-free simplices with lattice width $2 d - o (d)$