Lifting Cover Inequalities for the Binary Knapsack Polytope

Abstract

We consider the family of facets of the binary knapsack polytope from minimal covers. We study previous results on sequential lifting in a unifying framework and explore a class of most violated fractional lifted cover inequalities, defined by Balas and Zemel, which are more general than traditional simple lifted cover inequalities. We investigate some theoretical properties of these inequalities, propose two separation algorithms and illustrate these using several examples