Title: Recent proximity results in integer linear programmingSpeaker: Joseph Paat Affiliation: UBC Sauder School of Business Zoom: Please email Emma Watson.
We consider the proximity question in integer linear programming (ILP) --- Given a vector in a polyhedron, how close is the nearest integer vector? Proximity has been studied for decades with two influential results due to Cook et al. in 1986 and Eisenbrand and Weismantel in 2018. We derive new upper bounds on proximity using sparse integer solutions and mixed integer relaxations of the integer hull. When compared to previous bounds, these new bounds depend less on the dimensions of the constraint matrix and more on the data in the matrix.