Closest Assignment Constraints for Hub Disruption Problems

Supply chains and logistics can be well represented with hub networks. Operations of these hubs can be disrupted due to unanticipated occurrences or attacks. This study includes Closest assignment Constraints related to hub disruption problems, which can be used in single-level reformulation of the bilevel model. In this study, We propose new sets of constraints … 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