Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received May 15, 1996 / Revised version received August 7, 1998 Published online June 28, 1999
Rights and permissions
About this article
Cite this article
Gu, Z., Nemhauser, G. & Savelsbergh, M. Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Program. 85, 439–467 (1999). https://doi.org/10.1007/s101070050067
Issue date:
DOI: https://doi.org/10.1007/s101070050067