Abstract
We investigate lifting, i.e., the process of taking a valid inequality and using it to construct a valid inequality in a higher dimensional space. Lifting is usually applied sequentially; variables in a set are lifted one after the other. This is computationally unattractive since it involves the solution of an optimization problem to compute a lifting coefficient for each variable. To relieve this computational burden, we study the potential of sequence independent lifting techniques.
This research was supported by US Army Research Office DAAH04-94-G-0017 and NSF Grant No. DDM-9115768
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Balas, E.: Facets of the Knapsack Polytope. Mathematical Programming 8 (1975) 146–164.
Balas, E., Zemel, E.: Facets of the Knapsack Polytope from Minimal Covers. SIAM Journal on Applied Mathematics 34 (1978) 119–148.
Crowder, H., Johnson, E.L., Padberg, M.W.: Solving Large Scale Zero-One Linear Programming Problems. Operations Research 31 (1983) 803–834.
Gomory, R.E.: Some Polyhedra Related to Combinatorial Problems. Linear Algebra and Its Applications 2 (1969) 451–558.
Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted Cover Inequalities for 0–1 Integer Programs I: Computation. Report LEC-94-09, Georgia Institute of Technology, Atlanta (1994).
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988).
Padberg, M.W.: On the Facial Structure of Set Packing Polyhedra. Mathematical Programming 5 (1973) 199–215.
Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid Linear Inequalities for Fixed Charge Problems. Operations Research 33 (1985) 842–861.
Pochet, Y.: A Note on Lifting Single Node Flow Cover Inequalities. Unpublished manuscript (1993).
Van Roy, T.J., Wolsey, L.A.: Valid Inequalities for Mixed 0–1 Programs. Discrete Applied Mathematics 14 (1986) 199–213.
Wolsey, L.A.: Facets and Strong Valid Inequalities for Integer Programs. Operations Research 24 (1976) 367–372.
Wolsey, L.A.: Valid Inequalities and Superadditivity for 0–1 Integer Programs. Mathematics of Operations Research 2 (1977) 66–77.
Zemel, E.: Lifting the Facets of Zero-One Polytopes. Mathematical Programming 15 (1978) 268–277.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P. (1995). Sequence independent lifting of cover inequalities. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_72
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive