Article ID: | iaor20002398 |
Country: | Germany |
Volume: | 85 |
Issue: | 3 |
Start Page Number: | 439 |
End Page Number: | 467 |
Publication Date: | Jan 1999 |
Journal: | Mathematical Programming |
Authors: | Savelsbergh M.W.P., Nemhauser G.L., Gu Z. |
We investigate strong inequalities for mixed 0–1 integer programs derived from flow cover inequalities. Flow cover inequalities are usually not facet defining and need to be lifted to obtain stronger inequalities. However, because of the sequential nature of the standard lifting techniques and the complexity of the optimization problems that have to be solved to obtain lifting coefficients, lifting of flow cover inequalities is computationally very demanding. We present a computationally efficient way to lift flow cover inequalities based on sequence independent lifting techniques and give computational results that show the effectiveness of our lifting procedures.