On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms

Sergey S. Ketkov, Oleg A. Prokopyev

In this study, we consider a class of linear matroid interdiction problems, where the feasible sets for the upper-level decision-maker (referred to as a leader) and the lower-level…