Lifted flow cover inequalities for mixed 0-1 integer programs

We investigate strong inequalities for mixed 0-1 integer programs derived f rom flow cover inequalities. Flow cover inequalities are usually not facet defining and need to be lifted to obtain stronger inequalities. However, be cause of the sequential nature of the standard lifting techniques and the c omplexity of the optimization problems that have to be solved to obtain lif ting coefficients, lifting of flow cover inequalities is computationally ve ry demanding. We present a computationally efficient way to lift flow cover inequalities based on sequence independent lifting techniques and give com putational results that show the effectiveness of our lifting procedures.