Gioni Mexi

Preprints and reports

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},
     arxiv = {arXiv: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. Ghannam, M., Mexi, G., Lam, E., and Gleixner, A. (2024). Branch and Price for the Length-Constrained Cycle Partition Problem. [arXiv]
   [BibTeX]

   @misc{2024_GhannamMexiLamGleixner_Branchpricelccp,
     archiveprefix = {arXiv},
     eprint = {2401.17937},
     arxiv = {arXiv:2401.17937},
     primaryclass = {math.OC},
     author = {Ghannam, Mohammed and Mexi, Gioni and Lam, Edward and Gleixner, Ambros},
     title = {Branch and Price for the Length-Constrained Cycle Partition Problem},
     date = {2024-01-31}
   }

3. Hojny, C., Besançon, M., Bestuzheva, K., Borst, S., Dionísio, J., Ehls, J., Eifler, L., Ghannam, M., Gleixner, A., Göß, A., Hoen, A., von Holly-Ponientzietz, J., van der Hulst, R., Kamp, D., Koch, T., Kofler, K., Lentz, J., Lübbecke, M., Maher, S. J., … Xu, L. (2025). The SCIP Optimization Suite 10.0. [arXiv]
   [BibTeX]

   @misc{2025_ChristopherEtAl_Scip10_2511-18580,
     archiveprefix = {arXiv},
     eprint = {2511.18580},
     arxiv = {arXiv:2511.18580},
     primaryclass = {math.OC},
     author = {Hojny, Christopher and Besançon, Mathieu and Bestuzheva, Ksenia and Borst, Sander and Dionísio, João and Ehls, Johannes and Eifler, Leon and Ghannam, Mohammed and Gleixner, Ambros and Göß, Adrian and Hoen, Alexander and von Holly-Ponientzietz, Jacob and van der Hulst, Rolf and Kamp, Dominik and Koch, Thorsten and Kofler, Kevin and Lentz, Jurgen and Lübbecke, Marco and Maher, Stephen J. and Meinhold, Paul Matti and Mexi, Gioni and Mohr, Til and Mühmer, Erik and Patel, Krunal Kishor and Pfetsch, Marc and Pokutta, Sebastian and Reinartz Groba, Chantal and Serrano, Felipe and Shinano, Yuji and Turner, Mark and Vigerske, Stefan and Walter, Matthias and Weninger, Dieter and Xu, Liding},
     title = {The SCIP Optimization Suite 10.0},
     date = {2025-11-23}
   }

4. Kuzinowicz, D., Lichocki, P., Mexi, G., Pfetsch, M., Pokutta, S., and Zimmer, M. (2025). Objective Coefficient Rounding and Almost Symmetries in Binary Programs. [arXiv]
   [BibTeX]

   @misc{2025_KuzinowiczEtAl_ObjectiveroundingSymmetries_2512-10507,
     archiveprefix = {arXiv},
     eprint = {2512.10507},
     arxiv = {arXiv:2512.10507},
     primaryclass = {math.OC},
     author = {Kuzinowicz, Dominik and Lichocki, Paweł and Mexi, Gioni and Pfetsch, Marc and Pokutta, Sebastian and Zimmer, Max},
     title = {Objective Coefficient Rounding and Almost Symmetries in Binary Programs},
     date = {2025-12-11}
   }

5. Mexi, G., Kamp, D., Shinano, Y., Pu, S., Hoen, A., Bestuzheva, K., Hojny, C., Walter, M., Pfetsch, M., Pokutta, S., and Koch, T. (2025). State-of-the-art Methods for Pseudo-Boolean Solving with SCIP. [arXiv]
   [BibTeX]

   @misc{2025_MexiEtAl_Pseudobooleanscip,
     archiveprefix = {arXiv},
     eprint = {2501.03390},
     arxiv = {arXiv:2501.03390},
     primaryclass = {math.OC},
     author = {Mexi, Gioni and Kamp, Dominik and Shinano, Yuji and Pu, Shanwen and Hoen, Alexander and Bestuzheva, Ksenia and Hojny, Christopher and Walter, Matthias and Pfetsch, Marc and Pokutta, Sebastian and Koch, Thorsten},
     title = {State-of-the-art Methods for Pseudo-Boolean Solving with SCIP},
     date = {2025-01-06}
   }

6. Berthold, T., Kamp, D., Mexi, G., Pokutta, S., and Pólik, I. (2026). Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions. [arXiv]
   [BibTeX]

   @misc{2026_BertholdEtAl_Globalpackingoptimization_2605-04850,
     archiveprefix = {arXiv},
     eprint = {2605.04850},
     arxiv = {arXiv:2605.04850},
     primaryclass = {math.OC},
     author = {Berthold, Timo and Kamp, Dominik and Mexi, Gioni and Pokutta, Sebastian and Pólik, Imre},
     title = {Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions},
     date = {2026-05-06}
   }

7. Tjusila, G., Hoen, A., Kempke, N.-C., Mexi, G., Berthold, T., Gleixner, A., Koch, T., and Pokutta, S. (2026). CHAP: A Hybrid GPU-CPU Heuristic for MIP. [arXiv]
   [BibTeX]

   @misc{2026_GennesaretEtAl_Hybridheuristicmip_2605-05086,
     archiveprefix = {arXiv},
     eprint = {2605.05086},
     arxiv = {arXiv:2605.05086},
     primaryclass = {math.OC},
     author = {Tjusila, Gennesaret and Hoen, Alexander and Kempke, Nils-Christian and Mexi, Gioni and Berthold, Timo and Gleixner, Ambros and Koch, Thorsten and Pokutta, Sebastian},
     title = {CHAP: A Hybrid GPU-CPU Heuristic for MIP},
     date = {2026-05-06}
   }

8. Ghannam, M., Gleixner, A., Mexi, G., and Lam, E. (2026). A Numerically-safe Branch-Price-and-Cut Algorithm for the Length-Constrained Cycle Partition Problem. [arXiv]
   [BibTeX]

   @misc{2026_GhannamGleixnerMexiLam_Branchpricecut_2607-15837,
     archiveprefix = {arXiv},
     eprint = {2607.15837},
     arxiv = {arXiv:2607.15837},
     primaryclass = {math.OC},
     author = {Ghannam, Mohammed and Gleixner, Ambros and Mexi, Gioni and Lam, Edward},
     title = {A Numerically-safe Branch-Price-and-Cut Algorithm for the Length-Constrained Cycle Partition Problem},
     date = {2026-07-17}
   }

9. Mexi, G., and Rehfeldt, D. (2026). Race, Exchange, Improve: Finding high-quality MIP solutions quickly. [arXiv]
   [BibTeX]

   @misc{2026_MexiRehfeldt_HighQualityMIPSolutions_2609-05954,
     archiveprefix = {arXiv},
     eprint = {2609.05954},
     arxiv = {arXiv:2609.05954},
     primaryclass = {math.OC},
     author = {Mexi, Gioni and Rehfeldt, Daniel},
     title = {Race, Exchange, Improve: Finding high-quality MIP solutions quickly},
     date = {2026-09-05}
   }

Conference contributions

1. Berthold, T., Kamp, D., Mexi, G., Pokutta, S., and Pólik, I. (2027). Global Optimization for Combinatorial Geometry Problems Revisited in the Era of LLMs. Combinatorial Optimization, 16613, 121–135. Associated with ISCO 2026. DOI: 10.1007/978-3-032-34519-6_10 [arXiv]
   [BibTeX]

   @inproceedings{2026_BertholdEtAl_Globaloptimization_2601-05943,
     year = {2027},
     booktitle = {Combinatorial Optimization},
     series = {Lecture Notes in Computer Science},
     volume = {16613},
     publisher = {Springer Science+Business Media},
     pages = {121--135},
     doi = {10.1007/978-3-032-34519-6_10},
     archiveprefix = {arXiv},
     eprint = {2601.05943},
     arxiv = {arXiv:2601.05943},
     primaryclass = {math.OC},
     author = {Berthold, Timo and Kamp, Dominik and Mexi, Gioni and Pokutta, Sebastian and Pólik, Imre},
     title = {Global Optimization for Combinatorial Geometry Problems Revisited in the Era of LLMs}
   }

2. Mexi, G., Besançon, M., Bolusani, S., Chmiela, A., Hoen, A., and Gleixner, A. (2025). Scylla: A Matrix-Free Fix-Propagate-and-Project Heuristic for Mixed-Integer Optimization. Operations Research Proceedings 2023, 65–72. Associated with OR 2023. DOI: 10.1007/978-3-031-58405-3_9 [arXiv]
   [BibTeX]

   @inproceedings{2023_MexiEtAl_Scyllaheuristic,
     year = {2025},
     date = {2025-09-27},
     booktitle = {Operations Research Proceedings 2023},
     series = {Lecture Notes in Operations Research},
     publisher = {Springer Science+Business Media},
     pages = {65--72},
     doi = {10.1007/978-3-031-58405-3_9},
     archiveprefix = {arXiv},
     eprint = {2307.03466},
     arxiv = {arXiv:2307.03466},
     primaryclass = {math.OC},
     author = {Mexi, Gioni and Besançon, Mathieu and Bolusani, Suresh and Chmiela, Antonia and Hoen, Alexander and Gleixner, Ambros},
     title = {Scylla: A Matrix-Free Fix-Propagate-and-Project Heuristic for Mixed-Integer Optimization}
   }

3. Bolusani, S., Mexi, G., Besançon, M., and Turner, M. (2025). A Multi-reference Relaxation Enforced Neighborhood Search Heuristic in SCIP. Operations Research Proceedings 2024, 421–427. Associated with OR 2024. DOI: 10.1007/978-3-031-92575-7_60 [arXiv]
   [BibTeX]

   @inproceedings{2024_BolusaniMexiBesanconTurner_Multireferenceneighborhoodsearch,
     year = {2025},
     date = {2025-08-12},
     booktitle = {Operations Research Proceedings 2024},
     series = {Lecture Notes in Operations Research},
     publisher = {Springer Science+Business Media},
     pages = {421--427},
     doi = {10.1007/978-3-031-92575-7_60},
     archiveprefix = {arXiv},
     eprint = {2408.00718},
     arxiv = {arXiv:2408.00718},
     primaryclass = {math.OC},
     author = {Bolusani, Suresh and Mexi, Gioni and Besançon, Mathieu and Turner, Mark},
     title = {A Multi-reference Relaxation Enforced Neighborhood Search Heuristic in SCIP}
   }

4. Xu, L., Mexi, G., and Bestuzheva, K. (2025). Sparsity-Driven Aggregation of Mixed Integer Programs. 23rd International Symposium on Experimental Algorithms (SEA 2025), 338, 27:1–27:15. Associated with SEA 2025. DOI: 10.4230/lipics.sea.2025.27 [arXiv]
   [BibTeX]

   @inproceedings{2025_XuMexiBestuzheva_Sparsityaggregationmip_2502-01192,
     year = {2025},
     date = {2025-07-15},
     booktitle = {23rd International Symposium on Experimental Algorithms (SEA 2025)},
     series = {Leibniz International Proceedings in Informatics},
     volume = {338},
     publisher = {Schloss Dagstuhl – Leibniz Center for Informatics},
     pages = {27:1--27:15},
     doi = {10.4230/lipics.sea.2025.27},
     archiveprefix = {arXiv},
     eprint = {2502.01192},
     arxiv = {arXiv:2502.01192},
     primaryclass = {math.OC},
     author = {Xu, Liding and Mexi, Gioni and Bestuzheva, Ksenia},
     title = {Sparsity-Driven Aggregation of Mixed Integer Programs}
   }

5. Mexi, G., Shamsi, S., Besançon, M., and le Bodic, P. (2024). Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 14743, 56–73. Associated with CPAIOR 2024. DOI: 10.1007/978-3-031-60599-4_4 [arXiv]
   [BibTeX]

   @inproceedings{2023_MexiSomayehBesanconPierre_Probabilisticstrongbranching,
     year = {2024},
     booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
     series = {Lecture Notes in Computer Science},
     volume = {14743},
     publisher = {Springer Science+Business Media},
     pages = {56--73},
     doi = {10.1007/978-3-031-60599-4_4},
     archiveprefix = {arXiv},
     eprint = {2312.07041},
     arxiv = {arXiv:2312.07041},
     primaryclass = {math.OC},
     author = {Mexi, Gioni and Shamsi, Somayeh and Besançon, Mathieu and le Bodic, Pierre},
     title = {Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model}
   }

6. Ghannam, M., Mexi, G., Lam, E., and Gleixner, A. (2024). Branch and Price for the Length-Constrained Cycle Partition Problem. Accepted at INFORMS Optimization Society Conference. [URL] [arXiv]
   [BibTeX]

   @misc{2024_GhannamMexiLamGleixner_Branchpricelccp:1,
     howpublished = {Accepted at INFORMS Optimization Society Conference},
     year = {2024},
     url = {https://sites.google.com/view/ios2024refereed},
     archiveprefix = {arXiv},
     eprint = {2401.17937},
     arxiv = {arXiv:2401.17937},
     primaryclass = {math.OC},
     author = {Ghannam, Mohammed and Mexi, Gioni and Lam, Edward and Gleixner, Ambros},
     title = {Branch and Price for the Length-Constrained Cycle Partition Problem}
   }

7. Mexi, G., Berthold, T., Gleixner, A., and Nordström, J. (2023). Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), 280, 27:1–27:19. Associated with CP 2023. DOI: 10.4230/LIPIcs.CP.2023.27 [arXiv]
   [BibTeX]

   @inproceedings{2023_MexiBertholdGleixnerNordstrm_ConflictanalysisPseudoboolean,
     year = {2023},
     booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
     series = {Leibniz International Proceedings in Informatics},
     volume = {280},
     publisher = {Schloss Dagstuhl – Leibniz Center for Informatics},
     pages = {27:1--27:19},
     doi = {10.4230/LIPIcs.CP.2023.27},
     archiveprefix = {arXiv},
     eprint = {2307.14166},
     arxiv = {arXiv:2307.14166},
     primaryclass = {math.OC},
     author = {Mexi, Gioni and Berthold, Timo and Gleixner, Ambros and Nordström, Jakob},
     title = {Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning}
   }

8. Hoppmann, K., Mexi, G., Burdakov, O., Casselgren, C. J., and Koch, T. (2020). Minimum Cycle Partition with Length Requirements. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 12296, 273–282. Associated with CPAIOR 2020. DOI: 10.1007/978-3-030-58942-4_18
   [BibTeX]

   @inproceedings{2020_HoppmannEtAl_Minimumcyclepartition,
     year = {2020},
     booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
     series = {Lecture Notes in Computer Science},
     volume = {12296},
     publisher = {Springer Science+Business Media},
     pages = {273--282},
     doi = {10.1007/978-3-030-58942-4_18},
     author = {Hoppmann, Kai and Mexi, Gioni and Burdakov, Oleg and Casselgren, Carl Johan and Koch, Thorsten},
     title = {Minimum Cycle Partition with Length Requirements}
   }

Articles, chapters and books

1. Mexi, G., Hendrych, D., Designolle, S., Besançon, M., and Pokutta, S. (2026). A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization. Mathematical Programming Computation. DOI: 10.1007/s12532-026-00340-3 [URL] [arXiv] [code]
   [BibTeX]

   @article{2025_MexiEtAl_Frankwolfeheuristic_2508-01299,
     year = {2026},
     date = {2026-09-03},
     journal = {Mathematical Programming Computation},
     month = sep,
     doi = {10.1007/s12532-026-00340-3},
     url = {https://link.springer.com/article/10.1007/s12532-026-00340-3},
     archiveprefix = {arXiv},
     eprint = {2508.01299},
     arxiv = {arXiv:2508.01299},
     primaryclass = {math.OC},
     author = {Mexi, Gioni and Hendrych, Deborah and Designolle, Sébastien and Besançon, Mathieu and Pokutta, Sebastian},
     title = {A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization},
     code = {https://github.com/GioniMexi/FW-MIQCQP-Heuristic}
   }

2. Mexi, G., Serrano, F., Berthold, T., Gleixner, A., and Nordström, J. (2025). Cut-Based Conflict Analysis in Mixed Integer Programming. INFORMS Journal on Computing, ijoc.2024.0999. DOI: 10.1287/ijoc.2024.0999 [URL] [arXiv]
   [BibTeX]

   @article{2024_MexiSerranoBertholdGleixnerNordstroem_Cutbasedconflictanalysis,
     year = {2025},
     date = {2025-11-12},
     journal = {INFORMS Journal on Computing},
     pages = {ijoc.2024.0999},
     doi = {10.1287/ijoc.2024.0999},
     url = {https://pubsonline.informs.org/doi/10.1287/ijoc.2024.0999},
     archiveprefix = {arXiv},
     eprint = {2410.15110},
     arxiv = {arXiv:2410.15110},
     primaryclass = {math.OC},
     author = {Mexi, Gioni and Serrano, Felipe and Berthold, Timo and Gleixner, Ambros and Nordström, Jakob},
     title = {Cut-Based Conflict Analysis in Mixed Integer Programming}
   }

3. Mexi, G., Berthold, T., and Salvagnin, D. (2023). Using multiple reference vectors and objective scaling in the Feasibility Pump. EURO Journal on Computational Optimization, 11, 100066. DOI: 10.1016/j.ejco.2023.100066
   [BibTeX]

   @article{2023_BertholdMexiSalvagnin_Multiplereferencevectors,
     year = {2023},
     journal = {EURO Journal on Computational Optimization},
     volume = {11},
     pages = {100066},
     doi = {10.1016/j.ejco.2023.100066},
     author = {Mexi, Gioni and Berthold, Timo and Salvagnin, Domenico},
     title = {Using multiple reference vectors and objective scaling in the Feasibility Pump}
   }

4. Hoppmann-Baum, K., Burdakov, O., Mexi, G., Casselgren, C. J., and Koch, T. (2022). Length-constrained cycle partition with an application to UAV routing*. Optimization Methods & Software, 37(6), 2066–2102. DOI: 10.1080/10556788.2022.2053972
   [BibTeX]

   @article{2022_HoppmannEtAl_CyclepartitionUavrouting,
     year = {2022},
     journal = {Optimization Methods & Software},
     volume = {37},
     number = {6},
     pages = {2066--2102},
     doi = {10.1080/10556788.2022.2053972},
     author = {Hoppmann-Baum, Kai and Burdakov, Oleg and Mexi, Gioni and Casselgren, Carl Johan and Koch, Thorsten},
     title = {Length-constrained cycle partition with an application to UAV routing*}
   }