Integer programs admit feasible solutions with O(m) nonzeros on average over right-hand sides, improving upper bounds on the integer Carathéodory number when determinants are small.
In: Proceedings of the 1st Integer Programming and Combinat orial Optimization Conference
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sparsity of integer solutions in the average case
Integer programs admit feasible solutions with O(m) nonzeros on average over right-hand sides, improving upper bounds on the integer Carathéodory number when determinants are small.