Cut-Generating Functions for Integer Linear Programs
Cutting planes have become a key component of integer programming solvers. Most cutting planes in use currently are valid for Gomory’s corner relaxation, which is obtained by ignoring the nonnegativity of the basic variables in a tableau formulation. In this talk, we do not relax these nonnegativity constraints. We generalize …