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
e-mail
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

  1. 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]
    @techreport{2024_BolusaniEtAl_Scip9,
      year = {2024},
      institution = {Zuse Institute Berlin},
      type = {ZIB Report},
      month = feb,
      number = {24-02-29},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-95528},
      archiveprefix = {arXiv},
      eprint = {2402.17702},
      primaryclass = {math.OC},
      author = {Bolusani, Suresh and Besançon, Mathieu and Bestuzheva, Ksenia and Chmiela, Antonia and Dionísio, João and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Ghannam, Mohammed and Gleixner, Ambros and Graczyk, Christoph and Halbig, Katrin and Hedtke, Ivo and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Kamp, Dominik and Koch, Thorsten and Kofler, Kevin and Lentz, Jurgen and Manns, Julian and Mexi, Gioni and Mühmer, Erik and Pfetsch, Marc and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Turner, Mark and Vigerske, Stefan and Weninger, Dieter and Xu, Liding},
      title = {The SCIP Optimization Suite 9.0},
      code = {https://scipopt.org}
    }
  2. 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]
    @techreport{2021_BestuzhevaEtAl_Scip8,
      year = {2021},
      institution = {Zuse Institute Berlin},
      type = {ZIB Report},
      month = dec,
      number = {21-41},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-85309},
      author = {Bestuzheva, Ksenia and Besançon, Mathieu and Chen, Wei-Kun and Chmiela, Antonia and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Gaul, Oliver and Gamrath, Gerald and Gleixner, Ambros and Gottwald, Leona and Graczyk, Christoph and Halbig, Katrin and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Koch, Thorsten and Lübbecke, Marco and Maher, Stephen J. and Matter, Frederic and Mühmer, Erik and Müller, Benjamin and Pfetsch, Marc and Rehfeldt, Daniel and Schlein, Steffan and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Sofranac, Boro and Turner, Mark and Vigerske, Stefan and Wegscheider, Fabian and Wellner, Philipp and Weninger, Dieter and Witzig, Jakob},
      title = {The SCIP Optimization Suite 8.0},
      code = {https://scipopt.org}
    }

Conference proceedings

  1. 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]
    @inproceedings{2022_BestuzhevaGleixnerAchterberg_Rltcutsbilinear,
      year = {2023},
      booktitle = {Proceedings of Conference on Integer Programming and Combinatorial Optimization},
      pages = {14-28},
      doi = {10.1007/978-3-031-32726-1_2},
      archiveprefix = {arXiv},
      eprint = {2211.13545},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Achterberg, Tobias},
      title = {Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products}
    }
  2. 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]
    @inproceedings{2023_BestuzhevaGleixnerVlker_Soncconstraints,
      year = {2022},
      booktitle = {Proceedings of Proceedings of the Hungarian Global Optimization Workshop HUGO 2022},
      pages = {41-44},
      url = {https://inf.u-szeged.hu/hugo/},
      archiveprefix = {arXiv},
      eprint = {2304.12145},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Völker, Helena},
      title = {Strengthening SONC Relaxations with Constraints Derived From Variable Bounds}
    }

Full articles

  1. 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]
    @article{2022_BestuzhevaGleixnerAchterberg_Rltcutsbilinear_1,
      year = {2024},
      journal = {Mathematical Programming},
      doi = {https://doi.org/10.1007/s10107-024-02104-0},
      archiveprefix = {arXiv},
      eprint = {2211.13545},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Achterberg, Tobias},
      title = {Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms}
    }
  2. 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]
    @article{2021_BestuzhevaGleixnerVigerske_Perspectivecuts,
      year = {2023},
      journal = {Mathematical Programming Computation},
      volume = {15},
      pages = {703-731},
      doi = {10.1007/s12532-023-00246-4},
      note = {ZIB report 21-07},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-81821},
      archiveprefix = {arXiv},
      eprint = {2103.09573},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Vigerske, Stefan},
      title = {A Computational Study of Perspective Cuts}
    }
  3. 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]
    @article{2023_BestuzhevaEtAl_GlobaloptimizationScip80,
      year = {2023},
      journal = {Journal of Global Optimization},
      doi = {10.1007/s10898-023-01345-1},
      note = {ZIB report 23-01},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-89348},
      archiveprefix = {arXiv},
      eprint = {2301.00587},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Chmiela, Antonia and MĂĽller, Benjamin and Serrano, Felipe and Vigerske, Stefan and Wegscheider, Fabian},
      title = {Global Optimization of Mixed-integer Nonlinear Programs with SCIP 8.0}
    }
  4. 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]
    @article{2023_BestuzhevaEtAl_ResearchScip,
      year = {2023},
      journal = {ACM Transactions on Mathematical Software},
      doi = {10.1145/3585516},
      archiveprefix = {arXiv},
      eprint = {2303.07101},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Besançon, Mathieu and Chen, Wei-Kun and Chmiela, Antonia and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Gaul, Oliver and Gamrath, Gerald and Gleixner, Ambros and Gottwald, Leona and Graczyk, Christoph and Halbig, Katrin and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Koch, Thorsten and Lübbecke, Marco and Maher, Stephen J. and Matter, Frederic and Mühmer, Erik and Müller, Benjamin and Pfetsch, Marc and Rehfeldt, Daniel and Schlein, Steffan and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Sofranac, Boro and Turner, Mark and Vigerske, Stefan and Wegscheider, Fabian and Wellner, Philipp and Weninger, Dieter and Witzig, Jakob},
      title = {Enabling Research Through the SCIP Optimization Suite 8.0}
    }
  5. 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]
    @article{2021_RaminEtAl_Incrementalwatersymbiosis,
      year = {2021},
      journal = {Science of the Total Environment},
      volume = {751},
      doi = {10.1016/j.scitotenv.2020.141706},
      author = {Ramin, Elham and Bestuzheva, Ksenia and Gargalo, Carina and Ramin, Danial and Schneider, Carina and Ramin, Pedram and Flores-Alsina, Xavier and Andersen, Maj and Gernaey, Krist},
      title = {Incremental Design of Water Symbiosis Networks with Prior Knowledge: the Case of an Industrial Park in Kenya}
    }

🔬 Projects

Research Campus MODAL SynLab

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.

SynLab
Apr 2020 to Mar 2025
13
52

đź’¬ 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]