Facets of the knapsack polytope from non-minimal covers

We propose two new classes of valid inequalities (VIs) for the binary knapsack polytope, based on non-minimal covers. We also show that these VIs can be obtained through neither sequential nor simultaneous lifting of well-known cover inequalities. We further provide conditions under which they are facet-defining. The usefulness of these VIs is demonstrated using computational … Read more

Efficient Formulations for Multiple Allocation Hub Network Interdiction Problems

In this paper, we study a network interdiction problem on a multiple allocation, uncapacitated hub network. The problem is formulated as a bilevel Stackelberg game between an attacker and a defender, where the attacker identifies r out of p hubs to interdict so as to maximize the worst-case post-interdiction performance of the system with the … Read more