34 citations · 49 across the 15 of their papers we have counts for
3 papers · 2 filters
Optimizing Sparsity over Lattices and Semigroups
Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera +1
Motivated by problems in optimization we study the sparsity of the solutions to systems of linear Diophantine equations and linear integer programs, i.e., the number of non-zero en…
Sparsity of integer solutions in the average case
Timm Oertel, Joseph Paat, Robert Weismantel
We examine how sparse feasible solutions of integer programs are, on average. Average case here means that we fix the constraint matrix and vary the right-hand side vectors. For a…
The distributions of functions related to parametric integer optimization
Timm Oertel, Joseph Paat, Robert Weismantel
We consider the asymptotic distribution of the IP sparsity function, which measures the minimal support of optimal IP solutions, and the IP to LP distance function, which measures…