Lifting cover inequalities . . . knapsack problem

This paper considers the polyhedral structure of the precedence-constrained knapsack problem, which is a knapsack problem with precedence constraints imposed on the set of variables. The problem itself appears in many applications. Moreover, since the precedence constraints appear in many important integer programming problems, the polyhedral results can be used to develop cutting-plane algorithms for more general applications. In this paper, we propose a modification of the cover inequality, which explicitly considers the precedence constraints. A combinatorial, easily implementable lifting procedure of the modified cover inequality is given. The procedure can generate strong cuts very easily. We also propose an additional lifting procedure, which is a generalization of the lifting procedure for cover inequalities. Some properties of the lifted inequality are analyzed and the problem of finding an optimal order of lifting is also addressed