Sparse input data is data in which most of the data coefficients are zero. Many areas of scientific computing and optimization have been very successful in harnessing the effect of sparsity of input data to improve the efficacy of algorithms. Surprisingly, the use of sparsity of input data is a very under explored direction of research in the context of Integer Programming. Harnessing the sparsity present in the underlying linear relaxation, using decomposition/reformulation techniques and complexity results for approximation algorithms correspond to most of the previous results in this area. In this thesis, we deal with understanding the effect of sparsity in Integer Programming. We study how to approximate polytopes using sparse cuts under various settings. We propose a variant on feasibility pump that automatically detects and harnesses sparsity. We study the ratio of the number of integral extreme points to the total number of extreme points for a family of random polytopes as a function of sparsity. Finally, we discuss the strength of multi-row aggregation cuts in the context of sign-pattern integer programs.Ph.D
