We survey mixed-integer programming techniques as they are applied in bilevel optimization.
We focus on bilevel problems with convex or linear lower-level problems as well as on problems with mixed-integer lower levels.
Special attention is given to bilevel pricing problems, Stackelberg games, and interdiction problems.
The survey contains more than 250 references.
KLEINERT, T., LABBÉ, M., LJUBIC, I. et SCHMIDT, M. (2021). A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. European Journal on Computational Optimization, 9, pp. 100007.