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 hfting techniques.
CITATION STYLE
Gu, Z., Nemhauser, G. L., & Savelsbergh, M. W. P. (1995). Sequence independent lifting of cover inequalities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 920, pp. 452–461). Springer Verlag. https://doi.org/10.1007/3-540-59408-6_72
Mendeley helps you to discover research relevant for your work.