Ksenia Bestuzheva
I work on creating new techniques to efficiently solve mixed-integer nonlinear programs to global optimality. I develop relaxations and cutting planes for convex and nonconvex MINLPs, more specifically problems involving bilinear products, on/off constraints and polynomials. Furthermore, I am interested in generalized convexity and its applications to global optimization. My research is closely linked to the development of the solver SCIP.
📬 Contact
- office
- Room 3102 at ZIB
- bestuzheva (at) zib.de
- homepage
- kbestuzheva.github.io
- languages
- Russian and English
🎓 Curriculum vitae
- since 2018
- Researcher at ZIB
- Jul 2019
- Ph.D. in Computer Science at ANU
- Jun 2014
- Diploma in Applied Mathematics and Computer Science at GUU
đź“ť Publications and preprints
Preprints
- Bolusani, S., Besançon, M., Bestuzheva, K., Chmiela, A., DionĂsio, J., Donkiewicz, T., van Doornmalen, J., Eifler, L., Ghannam, M., Gleixner, A., Graczyk, C., Halbig, K., Hedtke, I., Hoen, A., Hojny, C., van der Hulst, R., Kamp, D., Koch, T., Kofler, K., … Xu, L. (2024). The SCIP Optimization Suite 9.0 (ZIB Report No. 24-02-29). Zuse Institute Berlin.
[URL]
[arXiv]
[code]
[BibTeX]
- Bestuzheva, K., Besançon, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., Lübbecke, M., Maher, S. J., … Witzig, J. (2021). The SCIP Optimization Suite 8.0 (ZIB Report No. 21-41). Zuse Institute Berlin.
[URL]
[code]
[BibTeX]
Conference proceedings
- Bestuzheva, K., Gleixner, A., and Achterberg, T. (2023). Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. Proceedings of Conference on Integer Programming and Combinatorial Optimization, 14–28.
DOI: 10.1007/978-3-031-32726-1_2
[arXiv]
[BibTeX]
- Bestuzheva, K., Gleixner, A., and Völker, H. (2022). Strengthening SONC Relaxations with Constraints Derived From Variable Bounds. Proceedings of Proceedings of the Hungarian Global Optimization Workshop HUGO 2022, 41–44.
[URL]
[arXiv]
[BibTeX]
Full articles
- Bestuzheva, K., Gleixner, A., and Achterberg, T. (2024). Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms. Mathematical Programming.
DOI: https://doi.org/10.1007/s10107-024-02104-0
[arXiv]
[BibTeX]
- Bestuzheva, K., Gleixner, A., and Vigerske, S. (2023). A Computational Study of Perspective Cuts. Mathematical Programming Computation, 15, 703–731.
DOI: 10.1007/s12532-023-00246-4
[URL]
[arXiv]
[BibTeX]
- Bestuzheva, K., Chmiela, A., MĂĽller, B., Serrano, F., Vigerske, S., and Wegscheider, F. (2023). Global Optimization of Mixed-integer Nonlinear Programs with SCIP 8.0. Journal of Global Optimization.
DOI: 10.1007/s10898-023-01345-1
[URL]
[arXiv]
[BibTeX]
- Bestuzheva, K., Besançon, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., Lübbecke, M., Maher, S. J., … Witzig, J. (2023). Enabling Research Through the SCIP Optimization Suite 8.0. ACM Transactions on Mathematical Software.
DOI: 10.1145/3585516
[arXiv]
[BibTeX]
- Ramin, E., Bestuzheva, K., Gargalo, C., Ramin, D., Schneider, C., Ramin, P., Flores-Alsina, X., Andersen, M., and Gernaey, K. (2021). Incremental Design of Water Symbiosis Networks with Prior Knowledge: the Case of an Industrial Park in Kenya. Science of the Total Environment, 751.
DOI: 10.1016/j.scitotenv.2020.141706
[BibTeX]
🔬 Projects
SynLab researches mathematical generalization of application-specific advances achieved in the Gas-, Rail– and MedLab of the research campus MODAL. The focus is on exact methods for solving a broad class of discrete-continuous optimization problems. This requires advanced techniques for structure recognition, consideration of nonlinear restrictions from practice, and the efficient implementation of mathematical algorithms on modern computer architectures. The results are bundled in a professional software package and complemented by a range of high-performance methods for specific applications with a high degree of innovation.
đź’¬ Talks and posters
Conference and workshop talks
- Jul 2024
- Generalized Convexity Applied to Branch-and-Bound Algorithms for MINLPs
33rd EURO Conference, Copenhagen - Sep 2023
- SCIP Beyond 8.0
7th RIKEN-MODAL Workshop, Berlin [PDF] - Sep 2023
- Product and Factor Filtering for RLT for Bilinear and Mixed-Integer Problems
OR Conference, Hamburg [PDF] - Jun 2023
- Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products
24th IPCO Conference [PDF] - May 2023
- Perspective Cuts for Generalized On/Off Constraints
MIP-23 Workshop [PDF]
View More / Less
- Jan 2023
- Tighter SONC Bounds for Polynomial Optimization Problems with Bounded Variable Domains
Combinatorial Optimization Workshop, Aussois [PDF] - Nov 2022
- Strengthening Dual Bounds in Branch-and-Bound by SONC Certificates
SCIP Workshop, Berlin [PDF] - Sep 2022
- Strengthening SONC Relaxations with Constraints Derived From Variable Bounds
HUGO 2022 Workshop, Szeged [PDF] - Jul 2022
- New Developments in the SCIP Optimization Suite 8
32nd EURO Conference, Espoo [PDF] - Sep 2021
- Recent Developments in SCIP
5th RIKEN-MODAL Workshop, Berlin [PDF] - Aug 2021
- Solving MINLPs with SCIP
22nd ifors Conference [PDF] - Jul 2021
- A Computational Study Of Perspective Cuts
31st EURO Conference, Athens [PDF] - Jun 2021
- Reformulation-Linearisation Technique for Implicit Bilinear Relations
MINLP Workshop [PDF] - Sep 2020
- Mixed-Integer Nonlinear Programming
4th CO@Work, Berlin [PDF] - Jun 2020
- Nonlinear Constraints in SCIP
SCIP Workshop, Berlin [PDF]