Sequence-independent lifting is a procedure for strengthening valid inequalities of an integer program. We generalize the sequence-independent lifting method of Gu, Nemhauser, and Savelsbergh (GNS lifting) for cover inequalities and correct an error in their proposed generalization.
Jan 24, 2024
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.
We apply these results to strengthen Balas' lifting theorem for cover inequalities and to produce lifted flow cover inequalities for a single node flow problem.
Lifting is usually applied sequentially; variables in a set are lifted one after the other. The resulting inequality depends on the order in which the variables ...
May 29, 1995 · In this paper we prove two lifting theorems for the clique partitioning polytope, which provide sufficient conditions for a valid inequality ...
We derive strong valid inequalities for the convex hull of its feasible solutions using sequence-independent lifting. For problems with a single cardinality ...
Oct 22, 2024 · We investigate several complexity issues related to branch-and-cut algorithms for 0-1 integer programming based on lifted cover inequalities ( ...
Abstract. We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, ...
Apr 14, 2023 · Hence, there exist cases where a lifted cover inequality strictly dominates the corresponding extended cover inequality. Note that an extended ...
Mar 1, 2011 · ... covering sets. We derive several families of facet-. 5 defining inequalities via sequence-independent lifting techniques. We then show that ...