Presolving linear bilevel optimization problems
Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by JACKETS SPLIT SUIT BYRON techniques from single-level mixed-integer optimization.Thus, during the last years and decades many branch-and-bound methods, cutting planes, or heuristics have been proposed