Column operations for mixed integer programs

programs. The essence of the algorithms to be discussed is a procedure
that erases columns of the given program at the expense of introducing
new columns corresponding to non-decomposable partial solutions.
We discuss the general setting as well as a number of special cases such
as the stable set problem. Computational results demonstrate the
power and the generality of the approach.