Integer Optimization

📝 Publications and preprints

Preprints

1. 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},
     primaryclass = {math.OC},
     year = {2025},
     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}
   }

2. Troppens, H., Besançon, M., Wilken, S. E., and Pokutta, S. (2025). Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks. [arXiv]
   [BibTeX]

   @misc{2025_TroppensBesanconWilkenPokutta_Mixedintegerloopless,
     archiveprefix = {arXiv},
     eprint = {2502.00807},
     primaryclass = {math.OC},
     year = {2025},
     author = {Troppens, Hannah and Besançon, Mathieu and Wilken, St. Elmo and Pokutta, Sebastian},
     title = {Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks},
     date = {2025-02-02}
   }

3. Xu, L., Mexi, G., and Bestuzheva, K. (2025). Sparsity-driven Aggregation of Mixed Integer Programs. [arXiv]
   [BibTeX]

   @misc{2025_XuMexiBestuzheva_Sparsityaggregationmip,
     archiveprefix = {arXiv},
     eprint = {2502.01192},
     primaryclass = {math.OC},
     year = {2025},
     author = {Xu, Liding and Mexi, Gioni and Bestuzheva, Ksenia},
     title = {Sparsity-driven Aggregation of Mixed Integer Programs},
     date = {2025-02-03}
   }

4. 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},
     date = {2024-02-27}
   }

5. Göß, A., Martin, A., Pokutta, S., and Sharma, K. (2023). Norm-induced Cuts: Optimization with Lipschitzian Black-box Functions. [URL] [arXiv]
   [BibTeX]

   @misc{2024_AdrianMartinPokuttaSharma_Norminducedcuts,
     url = {https://opus4.kobv.de/opus4-trr154/files/518/nic_preprint.pdf},
     archiveprefix = {arXiv},
     eprint = {2403.11546},
     primaryclass = {math.OC},
     year = {2024},
     author = {Göß, Adrian and Martin, Alexander and Pokutta, Sebastian and Sharma, Kartikey},
     title = {Norm-induced Cuts: Optimization with Lipschitzian Black-box Functions},
     date = {2023-05-16}
   }

6. Bolusani, S., Mexi, G., Besançon, M., and Turner, M. (2024). A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP. [arXiv]
   [BibTeX]

   @misc{2024_BolusaniMexiBesanconTurner_Multireferenceneighborhoodsearch,
     archiveprefix = {arXiv},
     eprint = {2408.00718},
     primaryclass = {math.OC},
     year = {2024},
     author = {Bolusani, Suresh and Mexi, Gioni and Besançon, Mathieu and Turner, Mark},
     title = {A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP},
     date = {2024-08-01}
   }

7. Borst, S., Eifler, L., and Gleixner, A. (2024). Certified Constraint Propagation and Dual Proof Analysis in a Numerically Exact MIP Solver. [arXiv]
   [BibTeX]

   @misc{2024_BorstEiflerGleixner_ConstraintpropagationDualproofMip,
     archiveprefix = {arXiv},
     eprint = {2403.13567},
     primaryclass = {math.OC},
     year = {2024},
     author = {Borst, Sander and Eifler, Leon and Gleixner, Ambros},
     title = {Certified Constraint Propagation and Dual Proof Analysis in a Numerically Exact MIP Solver},
     date = {2024-03-20}
   }

8. Halbig, K., Hoen, A., Gleixner, A., Witzig, J., and Weninger, D. (2024). A Diving Heuristic for Mixed-integer Problems with Unbounded Semi-continuous Variables. [arXiv]
   [BibTeX]

   @misc{2024_HalbigEtAl_Divingheuristic,
     archiveprefix = {arXiv},
     eprint = {2403.19411},
     primaryclass = {math.OC},
     year = {2024},
     author = {Halbig, Katrin and Hoen, Alexander and Gleixner, Ambros and Witzig, Jakob and Weninger, Dieter},
     title = {A Diving Heuristic for Mixed-integer Problems with Unbounded Semi-continuous Variables},
     date = {2024-03-28}
   }

9. Hoen, A., and Gleixner, A. (2024). Analyzing the Numerical Correctness of Branch-and-bound Decisions for Mixed-integer Programming. [arXiv]
   [BibTeX]

   @misc{2024_HoenGleixner_NumericalCorrectnessBnB,
     archiveprefix = {arXiv},
     eprint = {2412.14710},
     primaryclass = {math.OC},
     year = {2024},
     author = {Hoen, Alexander and Gleixner, Ambros},
     title = {Analyzing the Numerical Correctness of Branch-and-bound Decisions for Mixed-integer Programming},
     date = {2024-12-19}
   }

10. Hoen, A., Kamp, D., and Gleixner, A. (2024). MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers. [arXiv]
    [BibTeX]

    @misc{2024_HoenKampGleixner_Mipdebugger,
      archiveprefix = {arXiv},
      eprint = {2405.19770},
      primaryclass = {math.OC},
      year = {2024},
      author = {Hoen, Alexander and Kamp, Dominik and Gleixner, Ambros},
      title = {MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers},
      date = {2024-05-30}
    }

11. Mexi, G., Serrano, F., Berthold, T., Gleixner, A., and Nordström, J. (2024). Cut-based Conflict Analysis in Mixed Integer Programming. [arXiv]
    [BibTeX]

    @misc{2024_MexiSerranoBertholdGleixnerNordstroem_Cutbasedconflictanalysis,
      archiveprefix = {arXiv},
      eprint = {2410.15110},
      primaryclass = {math.OC},
      year = {2024},
      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},
      date = {2024-10-19}
    }

12. Xu, L., and D’Ambrosio, C. (2024). Formulations of the Continuous Set-covering Problem on Networks: a Comparative Study. [arXiv]
    [BibTeX]

    @misc{2024_XuDambrosio_Continuoussetcovering,
      archiveprefix = {arXiv},
      eprint = {2404.10467},
      primaryclass = {math.OC},
      year = {2024},
      author = {Xu, Liding and D'Ambrosio, Claudia},
      title = {Formulations of the Continuous Set-covering Problem on Networks: a Comparative Study},
      date = {2024-04-16}
    }

13. Xu, L., and Liberti, L. (2024). Relaxations for Binary Polynomial Optimization Via Signed Certificates. [arXiv]
    [BibTeX]

    @misc{2024_XuLiberti_RelaxationsBinaryPolynomial,
      archiveprefix = {arXiv},
      eprint = {2405.13447},
      primaryclass = {math.OC},
      year = {2024},
      author = {Xu, Liding and Liberti, Leo},
      title = {Relaxations for Binary Polynomial Optimization Via Signed Certificates},
      date = {2024-05-22}
    }

14. van Doornmalen, J., Eifler, L., Gleixner, A., and Hojny, C. (2023). A Proof System for Certifying Symmetry and Optimality Reasoning in Integer Programming. [arXiv]
    [BibTeX]

    @misc{2023_DoornmalenEiflerGleixnerHojny_Proofsystemsymmetry,
      archiveprefix = {arXiv},
      eprint = {2311.03877},
      primaryclass = {math.OC},
      year = {2023},
      author = {van Doornmalen, Jasper and Eifler, Leon and Gleixner, Ambros and Hojny, Christopher},
      title = {A Proof System for Certifying Symmetry and Optimality Reasoning in Integer Programming},
      date = {2023-11-07}
    }

15. Turner, M., Berthold, T., Besançon, M., and Koch, T. (2023). Branching Via Cutting Plane Selection: Improving Hybrid Branching. [arXiv]
    [BibTeX]

    @misc{2023_TurnerBertholdBesanconKoch_Branchingcuttingplane,
      archiveprefix = {arXiv},
      eprint = {2306.06050},
      primaryclass = {cs.RO},
      year = {2023},
      author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu and Koch, Thorsten},
      title = {Branching Via Cutting Plane Selection: Improving Hybrid Branching},
      date = {2023-06-01}
    }

16. Turner, M., Chmiela, A., Koch, T., and Winkler, M. (2023). PySCIPOpt-ML: Embedding Trained Machine Learning Models Into Mixed-integer Programs. [arXiv]
    [BibTeX]

    @misc{2023_TurnerChmielaKochMichael_Pyscipoptml,
      archiveprefix = {arXiv},
      eprint = {2312.08074},
      primaryclass = {math.OC},
      year = {2023},
      author = {Turner, Mark and Chmiela, Antonia and Koch, Thorsten and Winkler, Michael},
      title = {PySCIPOpt-ML: Embedding Trained Machine Learning Models Into Mixed-integer Programs},
      date = {2023-12-13}
    }

17. Hendrych, D., Troppens, H., Besançon, M., and Pokutta, S. (2022). Convex Integer Optimization with Frank-Wolfe Methods. [arXiv] [slides] [code]
    [BibTeX]

    @misc{2022_HendrychTroppensBesanconPokutta_Convexintegerfrankwolfe,
      archiveprefix = {arXiv},
      eprint = {2208.11010},
      primaryclass = {math.OC},
      year = {2022},
      author = {Hendrych, Deborah and Troppens, Hannah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Convex Integer Optimization with Frank-Wolfe Methods},
      code = {https://github.com/ZIB-IOL/Boscia.jl},
      slides = {https://pokutta.com/slides/20220915_boscia.pdf},
      date = {2022-08-23}
    }

18. 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] [arXiv] [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},
      archiveprefix = {arXiv},
      eprint = {2112.08872},
      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 Rehfeld, 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},
      date = {2021-12-16}
    }

19. Bolusani, S., Coniglio, S., Ralphs, T. K., and Tahernejad, S. (2021). A Unified Framework for Multistage Mixed Integer Linear Optimization. [arXiv]
    [BibTeX]

    @misc{2021_BolusaniConiglioRalphsTahernejad_Unifiedmultistagemilp,
      archiveprefix = {arXiv},
      eprint = {2104.09003},
      primaryclass = {math.OC},
      year = {2021},
      author = {Bolusani, Suresh and Coniglio, Stefano and Ralphs, Ted K. and Tahernejad, Sahar},
      title = {A Unified Framework for Multistage Mixed Integer Linear Optimization},
      date = {2021-04-19}
    }

Conference proceedings

1. Hendrych, D., Besançon, M., and Pokutta, S. (2023, December 18). Solving the Optimal Experiment Design Problem with Mixed-integer Convex Methods. Proceedings of the Symposium on Experimental Algorithms. DOI: 10.4230/LIPIcs.SEA.2024.16 [arXiv] [code]
   [BibTeX]

   @inproceedings{2023_HendrychBesanconPokutta_Optimalexperimentdesign,
     year = {2024},
     booktitle = {Proceedings of the Symposium on Experimental Algorithms},
     doi = {10.4230/LIPIcs.SEA.2024.16},
     archiveprefix = {arXiv},
     eprint = {2312.11200},
     primaryclass = {math.OC},
     author = {Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
     title = {Solving the Optimal Experiment Design Problem with Mixed-integer Convex Methods},
     code = {https://github.com/ZIB-IOL/OptimalDesignWithBoscia},
     date = {2023-12-18}
   }

2. Mexi, G., Shamsi, S., Besançon, M., and le Bodic, P. (2023, December 12). Probabilistic Lookahead Strong Branching Via a Stochastic Abstract Branching Model. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research. [arXiv]
   [BibTeX]

   @inproceedings{2023_MexiSomayehBesanconPierre_Probabilisticstrongbranching,
     year = {2024},
     booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
     archiveprefix = {arXiv},
     eprint = {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},
     date = {2023-12-12}
   }

3. Eifler, L., Witzig, J., and Gleixner, A. (2024, May 22). Branch and Cut for Partitioning a Graph Into a Cycle of Clusters. Proceedings of the International Symposium on Combinatorial Optimization. DOI: 10.1007/978-3-031-60924-4_8 [arXiv]
   [BibTeX]

   @inproceedings{2024_EiflerWitzigGleixner_Branchcutcycleclustering,
     year = {2024},
     date = {2024-05-22},
     booktitle = {Proceedings of the International Symposium on Combinatorial Optimization},
     doi = {10.1007/978-3-031-60924-4_8},
     archiveprefix = {arXiv},
     eprint = {2401.08412},
     primaryclass = {math.OC},
     author = {Eifler, Leon and Witzig, Jakob and Gleixner, Ambros},
     title = {Branch and Cut for Partitioning a Graph Into a Cycle of Clusters}
   }

4. Ghannam, M., Mexi, G., Lam, E., and Gleixner, A. (2024, March 10). Branch and Price for the Length-constrained Cycle Partition Problem. Proceedings of the INFORMS Optimization Society Conference. [URL] [arXiv]
   [BibTeX]

   @inproceedings{2024_GhannamMexiLamGleixner_Branchpricelccp,
     year = {2024},
     date = {2024-03-10},
     booktitle = {Proceedings of the INFORMS Optimization Society Conference},
     url = {https://sites.google.com/view/ios2024refereed},
     archiveprefix = {arXiv},
     eprint = {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}
   }

5. Hoen, A., Oertel, A., Gleixner, A., and Nordström, J. (2024). Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 310–328. DOI: 10.1007/978-3-031-60597-0_20 [arXiv]
   [BibTeX]

   @inproceedings{2024_HoenOertelGleixnerNordstrm_Mippresolvecertification,
     year = {2024},
     date = {2024-05-25},
     booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
     pages = {310-328},
     doi = {10.1007/978-3-031-60597-0_20},
     archiveprefix = {arXiv},
     eprint = {2401.09277},
     primaryclass = {math.OC},
     author = {Hoen, Alexander and Oertel, Andy and Gleixner, Ambros and Nordström, Jakob},
     title = {Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs}
   }

6. Sharma, K., Hendrych, D., Besançon, M., and Pokutta, S. (2024, January 31). Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe. Proceedings of the INFORMS Optimization Society Conference. [arXiv]
   [BibTeX]

   @inproceedings{2024_SharmaHendrychBesanconPokutta_NetworkdesignMicoFrankwolfe,
     year = {2024},
     booktitle = {Proceedings of the INFORMS Optimization Society Conference},
     archiveprefix = {arXiv},
     eprint = {2402.00166},
     primaryclass = {math.OC},
     author = {Sharma, Kartikey and Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
     title = {Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe},
     date = {2024-01-31}
   }

7. Bestuzheva, K., Gleixner, A., and Achterberg, T. (2023). Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms. Proceedings of the Conference on Integer Programming and Combinatorial Optimization, 14–28. DOI: 10.1007/978-3-031-32726-1_2 [arXiv]
   [BibTeX]

   @inproceedings{2022_BestuzhevaGleixnerAchterberg_Rltcutsbilinear:1,
     year = {2023},
     date = {2023-05-22},
     booktitle = {Proceedings of the 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 Terms}
   }

8. Turner, M., Berthold, T., Besançon, M., and Koch, T. (2022, December 14). Cutting Plane Selection with Analytic Centers and Multiregression. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research. [arXiv]
   [BibTeX]

   @inproceedings{2022_TurnerBertholdBesanconKoch_Cuttingplanemultiregression,
     year = {2023},
     booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
     archiveprefix = {arXiv},
     eprint = {2212.07231},
     primaryclass = {math.OC},
     author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu and Koch, Thorsten},
     title = {Cutting Plane Selection with Analytic Centers and Multiregression},
     date = {2022-12-14}
   }

9. Chmiela, A., Gleixner, A., Lichocki, P., and Pokutta, S. (2023). Online Learning for Scheduling MIP Heuristics. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 114–123. DOI: 10.1007/978-3-031-33271-5_8 [arXiv]
   [BibTeX]

   @inproceedings{2023_ChmielaGleixnerLichockiPokutta_Onlinelearningscheduling,
     year = {2023},
     date = {2023-05-23},
     booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
     pages = {114-123},
     doi = {10.1007/978-3-031-33271-5_8},
     archiveprefix = {arXiv},
     eprint = {2304.03755},
     primaryclass = {math.OC},
     author = {Chmiela, Antonia and Gleixner, Ambros and Lichocki, Pawel and Pokutta, Sebastian},
     title = {Online Learning for Scheduling MIP Heuristics}
   }

10. Chmiela, A., Muñoz, G., and Serrano, F. (2023, January 1). Monoidal Strengthening and Unique Lifting in MIQCPs. Proceedings of the Conference on Integer Programming and Combinatorial Optimization. [URL]
    [BibTeX]

    @inproceedings{2023_ChmielaMuozSerrano_Monoidalstrengthening:1,
      year = {2023},
      date = {2023-01-01},
      booktitle = {Proceedings of the Conference on Integer Programming and Combinatorial Optimization},
      url = {https://gonzalomunoz.org/monoidalforMIQCP.pdf},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {Monoidal Strengthening and Unique Lifting in MIQCPs}
    }

11. Ghannam, M., and Gleixner, A. (2023, July 21). Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows. Proceedings of the Conference of the Society for Operations Research in Germany. [arXiv]
    [BibTeX]

    @inproceedings{2023_GhannamGleixner_Hybridgeneticsearch,
      year = {2023},
      booktitle = {Proceedings of the Conference of the Society for Operations Research in Germany},
      archiveprefix = {arXiv},
      eprint = {2307.11800},
      primaryclass = {cs.NE},
      author = {Ghannam, Mohammed and Gleixner, Ambros},
      title = {Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows},
      date = {2023-07-21}
    }

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

    @inproceedings{2023_MexiBertholdGleixnerNordstrm_ConflictanalysisPseudoboolean,
      year = {2023},
      booktitle = {Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
      volume = {280},
      pages = {27:1-27:19,},
      doi = {10.4230/LIPIcs.CP.2023.27},
      archiveprefix = {arXiv},
      eprint = {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},
      date = {2023-07-26}
    }

13. Mexi, G., Besançon, M., Bolusani, S., Chmiela, A., Hoen, A., and Gleixner, A. (2023, July 7). Scylla: a Matrix-free Fix-propagate-and-project Heuristic for Mixed-integer Optimization. Proceedings of the Conference of the Society for Operations Research in Germany. [arXiv]
    [BibTeX]

    @inproceedings{2023_MexiEtAl_Scyllaheuristic,
      year = {2023},
      booktitle = {Proceedings of the Conference of the Society for Operations Research in Germany},
      archiveprefix = {arXiv},
      eprint = {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},
      date = {2023-07-07}
    }

14. Turner, M., Berthold, T., and Besançon, M. (2023, July 14). A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. Proceedings of the Conference of the Society for Operations Research in Germany. [arXiv]
    [BibTeX]

    @inproceedings{2023_TurnerBertholdBesancon_Contextawarecuttingplane,
      year = {2023},
      booktitle = {Proceedings of the Conference of the Society for Operations Research in Germany},
      archiveprefix = {arXiv},
      eprint = {2307.07322},
      primaryclass = {math.OC},
      author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu},
      title = {A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming},
      date = {2023-07-14}
    }

15. Gasse, M., Bowly, S., Cappart, Q., Charfreitag, J., Charlin, L., Chételat, D., Chmiela, A., Dumouchelle, J., Gleixner, A., Kazachkov, A. M., Khalil, E., Lichocki, P., Lodi, A., Lubin, M., Maddison, C. J., Christopher, M., Papageorgiou, D. J., Parjadis, A., Pokutta, S., … Kun, M. (2022). The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. Proceedings of the Conference on Neural Information Processing Systems, 176, 220–231. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2022_GasseEtAl_Ml4coinsights,
      year = {2022},
      booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
      month = jun,
      volume = {176},
      pages = {220–231},
      url = {https://proceedings.mlr.press/v176/gasse22a.html},
      archiveprefix = {arXiv},
      eprint = {2203.02433},
      primaryclass = {cs.LG},
      author = {Gasse, Maxime and Bowly, Simon and Cappart, Quentin and Charfreitag, Jonas and Charlin, Laurent and Chételat, Didier and Chmiela, Antonia and Dumouchelle, Justin and Gleixner, Ambros and Kazachkov, Aleksandr M. and Khalil, Elias and Lichocki, Pawel and Lodi, Andrea and Lubin, Miles and Maddison, Chris J. and Christopher, Morris and Papageorgiou, Dimitri J. and Parjadis, Augustin and Pokutta, Sebastian and Prouvost, Antoine and Scavuzzo, Lara and Zarpellon, Giulia and Yang, Linxin and Lai, Sha and Wang, Akang and Luo, Xiaodong and Zhou, Xiang and Huang, Haohan and Shao, Shengcheng and Zhu, Yuanming and Zhang, Dong and Quan, Tao and Cao, Zixuan and Xu, Yang and Huang, Zhewei and Zhou, Shuchang and Binbin, Chen and Minggui, He and Hao, Hao and Zhiyu, Zhang and Zhiwu, An and Kun, Mao},
      title = {The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights},
      date = {2022-03-04}
    }

16. Bestuzheva, K., Gleixner, A., and Völker, H. (2023). Strengthening SONC Relaxations with Constraints Derived From Variable Bounds. Proceedings of the Hungarian Global Optimization Workshop HUGO, 41–44. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2023_BestuzhevaGleixnerVlker_Soncconstraints,
      year = {2022},
      booktitle = {Proceedings of the Hungarian Global Optimization Workshop HUGO},
      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},
      date = {2023-04-24}
    }

17. Chmiela, A., Khalil, E. B., Gleixner, A., Lodi, A., and Pokutta, S. (2021). Learning to Schedule Heuristics in Branch-and-bound. Proceedings of the Conference on Neural Information Processing Systems, 34, 24235–24246. [URL] [arXiv] [poster]
    [BibTeX]

    @inproceedings{2021_ChmielaEtAl_Heuristicscheduling,
      year = {2021},
      booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
      month = mar,
      volume = {34},
      pages = {24235–24246},
      url = {https://proceedings.neurips.cc/paper_files/paper/2021/file/cb7c403aa312160380010ee3dd4bfc53-Paper.pdf},
      archiveprefix = {arXiv},
      eprint = {2103.10294},
      primaryclass = {cs.LG},
      author = {Chmiela, Antonia and Khalil, Elias B. and Gleixner, Ambros and Lodi, Andrea and Pokutta, Sebastian},
      title = {Learning to Schedule Heuristics in Branch-and-bound},
      poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_learningheuristics.pdf},
      date = {2021-03-18}
    }

18. Sofranac, B., Gleixner, A., and Pokutta, S. (2021). An Algorithm-independent Measure of Progress for Linear Constraint Propagation. Proceedings of the International Conference on Principles and Practice of Constraint Programming, 52:1–17. DOI: 10.4230/LIPIcs.CP.2021.52 [URL] [arXiv] [video]
    [BibTeX]

    @inproceedings{2021_SofranacGleixnerPokutta_Progressmeasure:1,
      year = {2021},
      booktitle = {Proceedings of the International Conference on Principles and Practice of Constraint Programming},
      pages = {52:1–17},
      doi = {10.4230/LIPIcs.CP.2021.52},
      url = {https://drops.dagstuhl.de/opus/volltexte/2021/15343/},
      archiveprefix = {arXiv},
      eprint = {2106.07573},
      primaryclass = {math.OC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {An Algorithm-independent Measure of Progress for Linear Constraint Propagation},
      video = {https://youtu.be/paZtGYlkBfE},
      date = {2021-06-14}
    }

19. Chmiela, A., Muñoz, G., and Serrano, F. (2021). On the Implementation and Strengthening of Intersection Cuts for QCQPs. Proceedings of the Conference on Integer Programming and Combinatorial Optimization, 134–147. DOI: 10.1007/978-3-030-73879-2_10
    [BibTeX]

    @inproceedings{2022_ChmielaMuozSerrano_Intersectioncutsqcqps:1,
      year = {2021},
      booktitle = {Proceedings of the Conference on Integer Programming and Combinatorial Optimization},
      pages = {134-147},
      doi = {10.1007/978-3-030-73879-2_10},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {On the Implementation and Strengthening of Intersection Cuts for QCQPs}
    }

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

    @inproceedings{2020_HoppmannEtAl_Minimumcyclepartition,
      year = {2020},
      booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      volume = {12296},
      pages = {273-282},
      doi = {10.1007/978-3-030-58942-4_18},
      author = {Hoppmann-Baum, Kai and Mexi, Gioni and Burdakov, Oleg and Casselgren, Carl Johan and Koch, Thorsten},
      title = {Minimum Cycle Partition with Length Requirements}
    }

21. Sofranac, B., Gleixner, A., and Pokutta, S. (2020). Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices. Proceedings of the 10th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, IA3 2020, 1–11. DOI: 10.1109/IA351965.2020.00007 [arXiv] [summary] [slides] [video]
    [BibTeX]

    @inproceedings{2020_SofranacGleixnerPokutta_Domainpropagation:1,
      year = {2020},
      booktitle = {Proceedings of the 10th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, IA3 2020},
      pages = {1-11},
      doi = {10.1109/IA351965.2020.00007},
      archiveprefix = {arXiv},
      eprint = {2009.07785},
      primaryclass = {cs.DC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices},
      slides = {https://app.box.com/s/qy0pjmhtbm7shk2ypxjxlh2sj4nudvyu},
      summary = {https://pokutta.com/blog/research/2020/09/20/gpu-prob.html},
      video = {https://youtu.be/7mERPal9pVs},
      date = {2020-09-16}
    }

Full articles

1. Bestuzheva, K., Gleixner, A., and Achterberg, T. (2022). 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,
     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},
     date = {2022-11-24}
   }

2. Deza, A., Pokutta, S., and Pournin, L. (2024). The Complexity of Geometric Scaling. Operations Research Letters, 52. DOI: 10.1016/j.orl.2023.11.010 [arXiv]
   [BibTeX]

   @article{2022_DezaPokuttaPournin_Geometricscaling,
     year = {2024},
     journal = {Operations Research Letters},
     date = {2024-01-01},
     volume = {52},
     doi = {10.1016/j.orl.2023.11.010},
     archiveprefix = {arXiv},
     eprint = {2205.04063},
     primaryclass = {math.OC},
     author = {Deza, Antoine and Pokutta, Sebastian and Pournin, Lionel},
     title = {The Complexity of Geometric Scaling}
   }

3. Bolusani, S., Besançon, M., Gleixner, A., Berthold, T., D’Ambrosio, C., Muñoz, G., Paat, J., and Thomopulos, D. (2024). The MIP Workshop 2023 Computational Competition on Reoptimization. Mathematical Programming Computation. DOI: 10.1007/s12532-024-00256-w [arXiv]
   [BibTeX]

   @article{2023_BolusaniEtAl_Mipreoptimization,
     year = {2024},
     journal = {Mathematical Programming Computation},
     date = {2024-06-06},
     doi = {10.1007/s12532-024-00256-w},
     archiveprefix = {arXiv},
     eprint = {2311.14834},
     primaryclass = {math.OC},
     author = {Bolusani, Suresh and Besançon, Mathieu and Gleixner, Ambros and Berthold, Timo and D'Ambrosio, Claudia and Muñoz, Gonzalo and Paat, Joseph and Thomopulos, Dimitri},
     title = {The MIP Workshop 2023 Computational Competition on Reoptimization}
   }

4. Chmiela, A., Muñoz, G., and Serrano, F. (2024). Monoidal Strengthening and Unique Lifting in MIQCPs. Mathematical Programming B. DOI: 10.1007/s10107-024-02112-0 [URL]
   [BibTeX]

   @article{2023_ChmielaMuozSerrano_Monoidalstrengthening,
     year = {2024},
     journal = {Mathematical Programming B},
     doi = {10.1007/s10107-024-02112-0},
     url = {https://gonzalomunoz.org/monoidalforMIQCP.pdf},
     author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
     title = {Monoidal Strengthening and Unique Lifting in MIQCPs}
   }

5. Eifler, L., and Gleixner, A. (2024). Safe and Verified Gomory Mixed Integer Cuts in a Rational MIP Framework. SIAM Journal on Optimization, 34(1), 742–763. DOI: 10.1137/23M156046X [URL] [arXiv]
   [BibTeX]

   @article{2023_EiflerGleixner_Gomorycuts,
     year = {2024},
     journal = {SIAM Journal on Optimization},
     date = {2024-02-16},
     volume = {34},
     number = {1},
     pages = {742-763},
     doi = {10.1137/23M156046X},
     note = {ZIB report 23-09},
     url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-90159},
     archiveprefix = {arXiv},
     eprint = {2303.12365},
     primaryclass = {math.OC},
     author = {Eifler, Leon and Gleixner, Ambros},
     title = {Safe and Verified Gomory Mixed Integer Cuts in a Rational MIP Framework}
   }

6. Eifler, L., Nicolas-Thouvenin, J., and Gleixner, A. (2024). Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization. INFORMS Journal on Computing. DOI: 10.1007/s10107-024-02104-0 [arXiv]
   [BibTeX]

   @article{2023_EiflerNicolasGleixner_Precisionboostinglp,
     year = {2024},
     journal = {INFORMS Journal on Computing},
     date = {2024-09-17},
     doi = {10.1007/s10107-024-02104-0},
     archiveprefix = {arXiv},
     eprint = {2311.08037},
     primaryclass = {math.OC},
     author = {Eifler, Leon and Nicolas-Thouvenin, Jules and Gleixner, Ambros},
     title = {Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization}
   }

7. Tjusila, G., Besançon, M., Turner, M., and Koch, T. (2024). How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem. Operations Research Letters. DOI: 10.1016/j.orl.2024.107105 [URL] [arXiv]
   [BibTeX]

   @article{2024_GennesaretBesanconTurnerKoch_Bilevelsudokuclue,
     year = {2024},
     journal = {Operations Research Letters},
     date = {2024-03-07},
     doi = {10.1016/j.orl.2024.107105},
     url = {https://sciencedirect.com/science/article/abs/pii/S0167637724000415},
     archiveprefix = {arXiv},
     eprint = {2305.01697},
     primaryclass = {math.OC},
     author = {Tjusila, Gennesaret and Besançon, Mathieu and Turner, Mark and Koch, Thorsten},
     title = {How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem.}
   }

8. Liberti, L., Iommazzo, G., Lavor, C., and Maculan, N. (2020). Cycle-based Formulations in Distance Geometry. Open Journal of Mathematical Optimization, 4(1). DOI: 10.5802/ojmo.18 [arXiv]
   [BibTeX]

   @article{2020_LibertiIommazzoLavorMaculan_Cycledistancegeometry_1,
     year = {2023},
     journal = {Open Journal of Mathematical Optimization},
     volume = {4},
     number = {1},
     doi = {10.5802/ojmo.18},
     archiveprefix = {arXiv},
     eprint = {2006.11523},
     primaryclass = {math.OC},
     author = {Liberti, Leo and Iommazzo, Gabriele and Lavor, Carlile and Maculan, Nelson},
     title = {Cycle-based Formulations in Distance Geometry},
     date = {2020-06-20}
   }

9. 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},
     date = {2023-08-21},
     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}
   }

10. Gleixner, A., Gottwald, L., and Hoen, A. (2023). PaPILO: a Parallel Presolving Library for Integer and Linear Programming with Multiprecision Support. INFORMS Journal on Computing. DOI: 10.1287/ijoc.2022.0171 [arXiv]
    [BibTeX]

    @article{2022_GleixnerGottwaldHoen_PapiloMultiprecision,
      year = {2023},
      journal = {INFORMS Journal on Computing},
      date = {2023-06-12},
      doi = {10.1287/ijoc.2022.0171},
      archiveprefix = {arXiv},
      eprint = {2206.10709},
      primaryclass = {math.OC},
      author = {Gleixner, Ambros and Gottwald, Leona and Hoen, Alexander},
      title = {PaPILO: a Parallel Presolving Library for Integer and Linear Programming with Multiprecision Support}
    }

11. Berthold, T., Mexi, G., and Salvagnin, D. (2023). Using Multiple Reference Vectors and Objective Scaling in the Feasibility Pump. EURO Journal on Computational Optimization, 11. DOI: 10.1016/j.ejco.2023.100066
    [BibTeX]

    @article{2023_BertholdMexiSalvagnin_Multiplereferencevectors,
      year = {2023},
      journal = {EURO Journal on Computational Optimization},
      volume = {11},
      doi = {10.1016/j.ejco.2023.100066},
      author = {Berthold, Timo and Mexi, Gioni and Salvagnin, Domenico},
      title = {Using Multiple Reference Vectors and Objective Scaling in the Feasibility Pump}
    }

12. 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},
      date = {2023-01-02}
    }

13. 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},
      date = {2023-03-10},
      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 Rehfeld, 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}
    }

14. Eifler, L., and Gleixner, A. (2022). A Computational Status Update for Exact Rational Mixed Integer Programming. Mathematical Programming, 197, 793–812. DOI: 10.1007/s10107-021-01749-5 [arXiv]
    [BibTeX]

    @article{2023_EiflerGleixner_Exactrationalmip,
      year = {2023},
      journal = {Mathematical Programming},
      date = {2022-01-07},
      volume = {197},
      pages = {793-812},
      doi = {10.1007/s10107-021-01749-5},
      archiveprefix = {arXiv},
      eprint = {2101.09141},
      primaryclass = {math.OC},
      author = {Eifler, Leon and Gleixner, Ambros},
      title = {A Computational Status Update for Exact Rational Mixed Integer Programming}
    }

15. Sofranac, B., Gleixner, A., and Pokutta, S. (2020). Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices. Parallel Computing, 109, 102874. DOI: 10.1016/j.parco.2021.102874 [arXiv] [summary]
    [BibTeX]

    @article{2020_SofranacGleixnerPokutta_Domainpropagation,
      year = {2022},
      journal = {Parallel Computing},
      volume = {109},
      pages = {102874},
      doi = {10.1016/j.parco.2021.102874},
      archiveprefix = {arXiv},
      eprint = {2009.07785},
      primaryclass = {cs.DC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices},
      summary = {https://pokutta.com/blog/research/2020/09/20/gpu-prob.html},
      date = {2020-09-16}
    }

16. Bolusani, S., and Ralphs, T. K. (2022). A Framework for Generalized Benders’ Decomposition and Its Applications to Multilevel Optimization. Mathematical Programming, 196, 389–426. DOI: 10.1007/s10107-021-01763-7 [arXiv]
    [BibTeX]

    @article{2021_BolusaniRalphs_Generalizedbendersdecomposition,
      year = {2022},
      journal = {Mathematical Programming},
      date = {2022-01-29},
      volume = {196},
      pages = {389-426},
      doi = {10.1007/s10107-021-01763-7},
      archiveprefix = {arXiv},
      eprint = {2104.06496},
      primaryclass = {math.OC},
      author = {Bolusani, Suresh and Ralphs, Ted K.},
      title = {A Framework for Generalized Benders' Decomposition and Its Applications to Multilevel Optimization}
    }

17. Sofranac, B., Gleixner, A., and Pokutta, S. (2022). An Algorithm-independent Measure of Progress for Linear Constraint Propagation. Constraints, 27, 432–455. DOI: 10.1007/s10601-022-09338-9 [arXiv]
    [BibTeX]

    @article{2021_SofranacGleixnerPokutta_Progressmeasure,
      year = {2022},
      journal = {Constraints},
      date = {2022-10-12},
      volume = {27},
      pages = {432-455},
      doi = {10.1007/s10601-022-09338-9},
      archiveprefix = {arXiv},
      eprint = {2106.07573},
      primaryclass = {math.OC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {An Algorithm-independent Measure of Progress for Linear Constraint Propagation}
    }

18. Chmiela, A., Muñoz, G., and Serrano, F. (2022). On the Implementation and Strengthening of Intersection Cuts for QCQPs. Mathematical Programming B, 197, 549–586. DOI: 10.1007/s10107-022-01808-5
    [BibTeX]

    @article{2022_ChmielaMuozSerrano_Intersectioncutsqcqps,
      year = {2022},
      journal = {Mathematical Programming B},
      volume = {197},
      pages = {549-586},
      doi = {10.1007/s10107-022-01808-5},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {On the Implementation and Strengthening of Intersection Cuts for QCQPs}
    }

19. Eifler, L., Gleixner, A., and Pulaj, J. (2022). A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture. ACM Transactions on Mathematical Software, 48(2), 1–12. DOI: 10.1145/3485630 [arXiv]
    [BibTeX]

    @article{2022_EiflerGleixnerPulaj_Safeintegerprogramming,
      year = {2022},
      journal = {ACM Transactions on Mathematical Software},
      date = {2022-05-26},
      volume = {48},
      number = {2},
      pages = {1-12},
      doi = {10.1145/3485630},
      archiveprefix = {arXiv},
      eprint = {1809.01572},
      primaryclass = {math.CO},
      author = {Eifler, Leon and Gleixner, Ambros and Pulaj, Jonad},
      title = {A Safe Computational Framework for Integer Programming Applied to Chvátal's Conjecture}
    }

20. 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 and Software. DOI: 10.1080/10556788.2022.2053972
    [BibTeX]

    @article{2022_HoppmannEtAl_CyclepartitionUavrouting,
      year = {2022},
      journal = {Optimization Methods and Software},
      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}
    }

21. Kossen, T., Hirzel, M., Madai, V. I., Boenisch, F., Hennemuth, A., Hildebrand, K., Pokutta, S., Sharma, K., Hilbert, A., Sobesky, J., Galinovic, I., Khalil, A. A., Fiebach, J. B., and Frey, D. (2022). Towards Sharing Brain Images: Differentially Private TOF-MRA Images with Segmentation Labels Using Generative Adversarial Networks. Frontiers in Artificial Intelligence. DOI: 10.3389/frai.2022.813842
    [BibTeX]

    @article{2022_KossenEtAl_Brainimagesharing,
      year = {2022},
      journal = {Frontiers in Artificial Intelligence},
      date = {2022-05-02},
      doi = {10.3389/frai.2022.813842},
      author = {Kossen, Tabea and Hirzel, Manuel and Madai, Vince I. and Boenisch, Franziska and Hennemuth, Anja and Hildebrand, Kristian and Pokutta, Sebastian and Sharma, Kartikey and Hilbert, Adam and Sobesky, Jan and Galinovic, Ivana and Khalil, Ahmed A. and Fiebach, Jochen B. and Frey, Dietmar},
      title = {Towards Sharing Brain Images: Differentially Private TOF-MRA Images with Segmentation Labels Using Generative Adversarial Networks}
    }

22. Iommazzo, G., D’Ambrosio, C., Frangioni, A., and Liberti, L. (2024). Algorithm Configuration Problem. In Encyclopedia of Optimization (pp. 1–8). DOI: 10.1007/978-3-030-54621-2_749-1 [arXiv]
    [BibTeX]

    @incollection{2024_IommazzoDambrosioFrangioniLiberti_Algorithmconfiguration,
      year = {2022},
      booktitle = {Encyclopedia of Optimization},
      pages = {1-8},
      doi = {10.1007/978-3-030-54621-2_749-1},
      archiveprefix = {arXiv},
      eprint = {2403.00898},
      primaryclass = {cs.AI},
      author = {Iommazzo, Gabriele and D'Ambrosio, Claudia and Frangioni, Antonio and Liberti, Leo},
      title = {Algorithm Configuration Problem},
      date = {2024-03-01}
    }

23. 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},
      date = {2021-01-10},
      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}
    }