65 citations · 253 across the 47 of their papers we have counts for
6 papers · 2 filters
Alternating Linear Minimization: Revisiting von Neumann's alternating projections
Gábor Braun, Sebastian Pokutta, Robert Weismantel
In 1933 von Neumann proved a beautiful result that one can approximate a point in the intersection of two convex sets by alternating projections, i.e., successively projecting on o…
Proximity and flatness bounds for linear integer optimization
Marcel Celaya, Stefan Kuhlmann, Joseph Paat +1
We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex…
Sparse Approximation Over the Cube
Sabrina Bruckmeier, Christoph Hunkenschröder, Robert Weismantel
This paper presents an anlysis of the NP-hard minimization problem , where $\text{supp}(x) = \{i \in [n]: x_i \ne…
Minimum-Cost Flows Over Time
Miriam Schlöter, Robert Weismantel
In this paper we show that every maximum minimum-cost flow over time problem has an optimal solution with a repeated structure if the given time horizon is large enough.
Minimizing a low-dimensional convex function over a high-dimensional cube
Christoph Hunkenschröder, Sebastian Pokutta, Robert Weismantel
For a matrix , , and a convex function , we are interested in minimizing over the se…
A Colorful Steinitz Lemma with Applications to Block Integer Programs
Timm Oertel, Joseph Paat, Robert Weismantel
The Steinitz constant in dimension is the smallest value such that for any norm on and for any finite zero-sum sequence in the unit ball, the sequence…