A classic result by Cook, Gerards, Schrijver, and Tardos provides an upper bound of $$n \Delta $$
on the proximity optimal solutions Integer Linear Programming problem its standard linear relaxation. In this bound, n is number variables $$\Delta denotes maximum absolute values subdeterminants constraint matrix. Hochbaum Shanthikumar, Werman Magagnosc showed that same valid if a more general co...
