Exact Methods for Discrete Γ-Robust Interdiction Problems with an Application to the Bilevel Knapsack Problem
Developing solution methods for mixed-integer bilevel problems is known to be a challenging task – even if all parameters of the problem are exactly known. Many real-world applications of bilevel optimization, however, involve data uncertainty due to some kind of bounded rationality. We study mixed-integer min-max problems with a follower who faces uncertainties regarding the … Read more