research
∙
10/06/2022
Sparse Approximation Over the Cube
This paper presents an anlysis of the NP-hard minimization problem min{b...
share
research
∙
06/01/2022
Minimum-Cost Flows Over Time
In this paper we show that every maximum minimum-cost flow over time pro...
research
∙
04/11/2022
Optimizing a low-dimensional convex function over a high-dimensional cube
For a matrix W ∈ℤ^m × n, m ≤ n, and a convex function g: ℝ^m →ℝ, we are ...
research
∙
06/28/2021
Notes on {a,b,c}-Modular Matrices
Let A ∈ℤ^m × n be an integral matrix and a, b, c ∈ℤ satisfy a ≥ b ≥ c ≥ ...
research
∙
12/21/2020
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity
We consider the problem of solving integer programs of the form min{ c^⊺...
research
∙
02/18/2020
N-fold integer programming via LP rounding
We consider N-fold integer programming problems. After a decade of conti...
research
∙
04/15/2019
Most IPs with bounded determinants can be solved in polynomial time
In 1983 Lenstra showed that an integer program (IP) is fixed parameter t...
research
∙
10/05/2018
