Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
On the Complexity of Bilevel Linear and Quadratic Programs in Fixed Dimensions
Sergey S. Ketkov, Oleg A. Prokopyev
It is well-known that general bilevel linear programs (BLPs) are strongly -hard, even when the leader's and the follower's objective functions are exact opposites. However, the…
cs.CC2025
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…