Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions

In deriving the well known cuts for cutting-plane methods in 0, 1 integer programming, the integer points outside the 0,1 space can limit the parallel movement of the hyperplane of the cut toward the solution set. Furthermore it is unnecessarily restrictive to limit the movement of this hyperplane to parallel translations. This paper removes these two limitations in order to derive stronger cuts and reduce the total number of cuts required. Thus, it describes a method based on a special case of the knapsack function that replaces each cut or original constraint by a new inequality whose hyperplane passes through as many integer points in 0, 1 space as possible.