1 problem

Fixed-$\Delta$ tractability conjecture. There is a polynomial-time algorithm to solve any integer program of the form (IP) with a $\Delta$-modular constraint matrix.