# Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs

We consider ILPs, where each variable corresponds to an integral point within a polytope π«, i. e., ILPs of the form min{c^β€x|β_pβπ«β©β€^d x_p p = b, xββ€^|π«β©β€^d|_β₯ 0}. The distance between an optimal fractional solution and an optimal integral solution (called proximity) is an important measure. A classical result by Cook et al.Β (Math. Program., 1986) shows that it is at most Ξ^Ξ(d) where Ξ is the largest coefficient in the constraint matrix. Another important measure studies the change in an optimal solution if the right-hand side b is replaced by another right-hand side b'. The distance between an optimal solution x w.r.t.Β b and an optimal solution x' w.r.t.Β b' (called sensitivity) is similarly bounded, i. e., β b-b' β_1Β·Ξ^Ξ(d), also shown by Cook et al. Even after more than thirty years, these bounds are essentially the best known bounds for these measures. While some lower bounds are known for these measures, they either only work for very small values of Ξ, require negative entries in the constraint matrix, or have fractional right-hand sides. Hence, these lower bounds often do not correspond to instances from algorithmic problems. This work presents for each Ξ > 0 and each d > 0 ILPs of the above type with non-negative constraint matrices such that their proximity and sensitivity is at least Ξ^Ξ(d). Furthermore, these instances are closely related to instances of the Bin Packing problem as they form a subset of columns of the configuration ILP. We thereby show that the results of Cook et al. are indeed tight, even for instances arising naturally from problems in combinatorial optimization.

## Authors

• 11 publications
• 27 publications
• 7 publications
• ### An Improved Approximation Algorithm for TSP in the Half Integral Case

We design a 1.49993-approximation algorithm for the metric traveling sal...
08/01/2019 β by Anna Karlin, et al. β 0 β

• ### Tight complexity lower bounds for integer linear programming with few constraints

We consider the ILP Feasibility problem: given an integer linear program...
11/03/2018 β by DuΕ‘an Knop, et al. β 0 β

• ### Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity

We consider the problem of solving integer programs of the form min{ c^βΊ...
12/21/2020 β by Jana Cslovjecsek, et al. β 0 β

• ### Congruency-Constrained TU Problems Beyond the Bimodular Case

A long-standing open question in Integer Programming is whether integer ...
09/07/2021 β by Martin NΓ€gele, et al. β 0 β

• ### Interruptible Algorithms for Multiproblem Solving

In this paper we address the problem of designing an interruptible syste...
10/26/2018 β by Spyros Angelopoulos, et al. β 0 β