Author:
Horländer Andreas,Schmidt Martin
Publisher
Springer International Publishing
Reference8 articles.
1. de Santis, M., de Vries, S., Schmidt, M., & Winkel, L. (2022). A penalty branch-and-bound method for mixed-binary linear complementarity problems. INFORMS Journal on Computing.
2. Dempe, S., & Dutta, J. (2012). Is bilevel programming a special case of a mathematical program with complementarity constraints? Mathematical Programming, 131(1), 37–48.
3. Fischetti, M., Ljubić, I., Monaci, M., & Sinnl, M. (2017). A new general-purpose algorithm for mixed-integer bilevel linear programs. Operations Research, 65(6), 1615–1637.
4. Hansen, P., Jaumard, B., & Savard, G. (1992). New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13(5), 1194–1217.
5. Horländer, A., & Schmidt, M. (2022). A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. Part II: Penalty parameter updates and numerical results.