Valid Inequalities and Superadditivity for 0–1 Integer Programs

It is shown that valid inequalities for 0–1 problems can be essentially characterized by two underlying functions, one of which is superadditive. These functions are essential to the characterization of maximal inequalities, the projection of valid inequalities and the definition of a master polytope. Similar properties are shown to hold for 0–1 group problems.