2000 character limit reached
On the Complexity of Separating Cutting Planes for the Knapsack Polytope (2111.06556v3)
Published 12 Nov 2021 in math.OC
Abstract: We close three open problems in the separation complexity of valid inequalities for the knapsack polytope. Specifically, we establish that the separation problems for extended cover inequalities, (1,k)-configuration inequalities, and weight inequalities are all NP-complete. We also give a number of special cases where the separation problem can be solved in polynomial time.