An O(n log n) procedure for identifying facets of the knapsack polytope

An O(n log n) procedure is presented for obtaining facets of the knapsack polytope by lifting the inequalities induced by the extensions of strong minimal covers. The procedure does not require any sequential lifting of the inequalities. In contrast, it utilizes the information from the maximal cliques implied by the knapsack constraint for determining the combination of the lifting coefficients to generate each facet.