14 citations · 30 across the 20 of their papers we have counts for
3 papers · 1 filter
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…
The Integrality Number of an Integer Program
Joseph Paat, Miriam Schlöter, Robert Weismantel
We introduce the integrality number of an integer program (IP) in inequality form. Roughly speaking, the integrality number is the smallest number of integer constraints needed to…