On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint

In this short note we obtain the full set of inequalities that define the convex hull of a 0–1 knapsack constraint presented by Weismantel. For that purpose we use our O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates, as well as our schemes for coefficient increase based tightening cover induced inequalities and coefficient reduction based tightening general 0–1 knapsack constraints.