activity
20182026
most citedOn a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing 2026 · math.OCShow all

1 paper · 2 filters

math.OC2026

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification

Sergey S. Ketkov, Oleg A. Prokopyev

A standard approach to solving optimistic bilevel linear programs (BLPs) is to replace the lower-level problem with its Karush-Kuhn-Tucker (KKT) optimality conditions and reformula…