13 citations · 22 across the 8 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
On the Tightness of Standard Relaxations for Mixed-Integer Bilevel Linear Programs
Sergey S. Ketkov, Oleg A. Prokopyev
Exact algorithms for solving mixed-integer bilevel linear programs (MIBLPs) typically rely on sequences of lower and upper bounds that converge to the optimal value. These procedur…
cs.CC2025
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.CC2024★ 1 cited
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…