49 citations · 103 across the 15 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.OC2021
On the Complexity of Separating Cutting Planes for the Knapsack Polytope
Alberto Del Pia, Jeff Linderoth, Haoran Zhu
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 cove…
math.OC2021
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets: Theory and Computation
Alberto Del Pia, Jeff Linderoth, Haoran Zhu
We propose a method to generate cutting-planes from multiple covers of knapsack constraints. The covers may come from different knapsack inequalities if the weights in the inequali…