Research Campus MODAL SynLab
This project develops the SCIP Optimization Suite and generalizes application-specific advances from MODAL's vertical labs into exact methods for constraint integer programming. The focus is on structure recognition, nonlinear constraints, and efficient implementation on modern architectures.
IOL Project Members
External Project Members
Funding
This project was being funded by the Forschungscampus MODAL (project ID 05M20ZBM), itself funded by the Federal Ministry of Research, Technology and Space (BMFTR) under Forschungscampus from April 2020 to March 2025.

This project is being funded by the Forschungscampus MODAL (project ID 05M20ZBM), itself funded by the Federal Ministry of Research, Technology and Space (BMFTR) under Forschungscampus from April 2025 to March 2030.

Project Description
MODAL’s vertical labs (EnergyLab, MobilityLab, MedLab, NanoLab) develop specialized optimization methods for their application domains. SynLab, as a horizontal competence lab, synthesizes these advances into a unified framework for mixed-integer and constraint integer programming. The primary output is the SCIP Optimization Suite, one of the fastest open-source solvers for mixed-integer linear and nonlinear optimization. Key research directions include automatic structure recognition, handling nonlinear constraints from practice, and efficient algorithm implementation on heterogeneous compute platforms.
Talks and posters
Conference and workshop talks
- Nov 2026
- SCIP Optimization Suite and Parallel MIP: Recent Developments by Gioni Mexi
21st INFORMS Annual Meeting (INFORMS), San Francisco - Sep 2026
- SCIP-Racer: A Lightweight Parallel Racing Framework for MIP by Gioni Mexi
OR Conference, Passau - Jul 2026
- Deterministic Solver Benchmarking in Heterogeneous Environments by Mohammed Ghannam
ZIB-Siemens workshop, Berlin - Jul 2026
- On ADMM, Frank-Wolfe, Cutting Plane Algorithms for Quantum Entanglement Detection by Liding Xu
23rd Conference on Advances in Continuous Optimization (EUROPT), Linz - Jul 2026
- Modular Presolving Techniques for Quadratic Integer Programming by Jan-Erik Hein
ZIB-Siemens workshop, Berlin - Jul 2026
- Coordinating Heuristics Across Platforms – A Hybrid GPU-CPU Framework for MIP by Gennesaret Tjusila
ZIB-Siemens workshop, Berlin - Jul 2026
- Finding Best Known Geometric Packings by Nonlinear Programming with SCIP by Dominik Kamp
ZIB-Siemens workshop, Berlin - Jun 2026
- Integer Frank-Wolfe for Optimal Experiment Design by Deborah Hendrych
SIAM conference on optimization (SIAMOP), Edinburgh - Jun 2026
- Exact Solutions for the Graph Isomorphism with Convex Mixed Integer Optimization by Wenjie Xiao
SIAM conference on optimization (SIAMOP), Edinburgh - Jun 2026
- First-Order Convex (mixed-Integer) Optimization: FrankWolfe.jl and Boscia.jl by Deborah Hendrych
JuMP-dev Workshop (JuMP-dev), Edinburgh [PDF] [video] - May 2026
- The Graph Isomorphism Problem From a Mixed-Integer Convex Optimization Perspective by Wenjie Xiao
23rd CPAIOR Conference, Rabat - May 2026
- CHAP – Coordinating Heuristics Across Platforms by Gioni Mexi
23rd Mixed Integer Programming Workshop (MIP), Stamford - Nov 2025
- The SCIP Optimization Suite 10 by Stefan Vigerske
ZIB-Siemens workshop, Munich - Nov 2025
- Finding Irreducible Infeasible Subsystems by Paul Meinhold
ZIB-Siemens workshop, Munich - Nov 2025
- A Frank-Wolfe-Based Primal Heuristic for Quadratic Mixed Integer Optimization by Gioni Mexi
ZIB-Siemens workshop, Munich - Nov 2025
- An Auto Tuner for Mixed Integer Programming Solvers by Dominik Kamp
ZIB-Siemens workshop, Munich - Sep 2025
- Optimal Experiment Design with Mixed-Integer Convex Methods by Deborah Hendrych
16th Global Optimization Workshop (STOGO), Stockholm - Jul 2025
- Lower Bounds for Binary Polynomial Optimization via Signed Certificates by Liding Xu
8th International Conference on Continuous Optimization (ICCOPT), Los Angeles - Jul 2025
- Sparsity-Driven Aggregation of Mixed Integer Programs by Gioni Mexi
23rd Symposium on Experimental Algorithms (SEA), Venice - Jul 2025
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods by Deborah Hendrych
22nd Conference on Advances in Continuous Optimization (EUROPT), Southampton - Jun 2025
- State-of-the-Art Methods for Pseudo-Boolean Solving with SCIP by Gioni Mexi
34th European Conference on Operational Research (EURO), Leeds - Jun 2025
- Frank-Wolfe Meets Branch-and-Bound for Quadratic Mixed-Integer Optimization by Gioni Mexi
22nd Mixed Integer Programming Workshop (MIP), Minneapolis - May 2025
- Decomposition Approaches for Energy-Aware Shop-Scheduling Problems by Marouane Felloussi
ZIB-Siemens workshop, Berlin - May 2025
- Sparsity-Driven Aggregation of Mixed Integer Programs by Liding Xu
ZIB-Siemens workshop, Berlin - May 2025
- Recent Advances in SCIP Optimization Suite 10 by Gioni Mexi
ZIB-Siemens workshop, Berlin - Feb 2025
- Towards an Exact Framework for Quantum State Separable Problem by Liding Xu
26th ROADEF Conference, Champs-sur-Marne - Sep 2024
- The Relax-and-Cut Framework in the SCIP Optimization Solver by Suresh Bolusani
OR Conference, Munich - Sep 2024
- What Is New in the SCIP Optimization Suite 9.0 by Ksenia Bestuzheva
OR Conference, Munich - Jul 2024
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods by Deborah Hendrych
22nd Symposium on Experimental Algorithms (SEA), Vienna - Jul 2024
- Polyhedrality Made Easy: Using General Cut Operators to Determine When Cut Closures Are Polyhedral by Antonia Chmiela
25th International Symposium on Mathematical Programming (ISMP), Montréal - Jul 2024
- Generalized Resolution Conflict Analysis in MIP Solvers by Gioni Mexi
25th International Symposium on Mathematical Programming (ISMP), Montréal - Jul 2024
- Certificates of Correctness for Presolving Binary Programs by Alexander Hoen
25th International Symposium on Mathematical Programming (ISMP), Montréal - Jul 2024
- Modelling of Piece-Wise Linear Concave Constraints in Continous Covering Problems by Liding Xu
33rd European Conference on Operational Research (EURO), Copenhagen - Jul 2024
- Generalized Convexity Applied to Branch-and-Bound Algorithms for MINLPs by Ksenia Bestuzheva
33rd European Conference on Operational Research (EURO), Copenhagen - Jul 2024
- Recent Advances in the SCIP Optimization Solver by Suresh Bolusani
33rd European Conference on Operational Research (EURO), Copenhagen - May 2024
- Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model by Gioni Mexi
21st CPAIOR Conference, Uppsala - May 2024
- Certifying MIP-Based Presolve Reductions for 0-1 Integer Linear Programs by Alexander Hoen
21st CPAIOR Conference, Uppsala - Apr 2024
- Updates in SCIP 9 by Gioni Mexi
SAP-ZIB-FAU workshop, Walldorf - Mar 2024
- Efficient Relax-and-Cut Separation in a Branch-and-Cut Solver by Suresh Bolusani
INFORMS Optimization Society Conference (IOS), Houston - Jan 2024
- Monoidal Strengthening and Unique Lifting in MIQCPs by Antonia Chmiela
Combinatorial Optimization Workshop, Aussois - Nov 2023
- Relax-and-Cut Framework-Based Lagromory Separator in SCIP by Suresh Bolusani
ZIB-Siemens workshop, Berlin - Nov 2023
- Recent Advances in SCIP Optimization Suite by Alexander Hoen
ZIB-Siemens workshop, Berlin - Sep 2023
- Lagromory Separator in SCIP by Suresh Bolusani
SAP-ZIB-FAU workshop, Walldorf - Sep 2023
- SCIP Beyond 8.0 by Ksenia Bestuzheva
7th ZIB-IMI-ISM-NUS-RIKEN-MODAL Workshop [PDF] - Sep 2023
- Recent Advances in SCIP by Alexander Hoen
SAP-ZIB-FAU workshop, Walldorf - Sep 2023
- Product and Factor Filtering for RLT for Bilinear and Mixed-Integer Problems by Ksenia Bestuzheva
OR Conference, Hamburg [PDF] - Aug 2023
- Scylla: A Matrix-Free Fix-Propagate-and-Project Heuristic for Mixed Integer Optimization by Suresh Bolusani
OR Conference, Hamburg - Aug 2023
- Experiments on Sparsity & Sparsification in Cutting Plane Selection by Mathieu Besançon
OR Conference, Hamburg - Aug 2023
- Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning by Gioni Mexi
29th CP Conference, Toronto [PDF] - Jul 2023
- Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning by Gioni Mexi
14th Pragmatics of SAT international workshop [PDF] - Jul 2023
- On Performance Variability in Pseudo-Boolean Solving and the Impact of Trivial Model Simplifications by Alexander Hoen
Pragmatics of SAT 2023 - Jun 2023
- Monoidal Strengthening and Unique Lifting in MIQCPs by Antonia Chmiela
24th IPCO Conference, Madison - Jun 2023
- Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products by Ksenia Bestuzheva
24th IPCO Conference, Madison [PDF] - Jun 2023
- Recent Developments in SCIP by Suresh Bolusani
SIAM conference on optimization (SIAMOP), Seattle - May 2023
- Online Learning for Scheduling MIP Heuristics by Antonia Chmiela
20th CPAIOR Conference, Nice - May 2023
- Perspective Cuts for Generalized On/Off Constraints by Ksenia Bestuzheva
20th Mixed Integer Programming Workshop (MIP) (online) [PDF] - May 2023
- MIPcc23: The MIP Workshop 2023 Computational Competition by Suresh Bolusani
20th Mixed Integer Programming Workshop (MIP) (online) - May 2023
- Online Learning for Scheduling MIP Heuristics by Antonia Chmiela
ZIB-Siemens workshop, Munich - May 2023
- The MIP 2023 Computational Competition by Ambros Gleixner
ZIB-Siemens workshop, Munich - Feb 2023
- Cutting Plane Selection with Analytic Centers by Mathieu Besançon
24th ROADEF Conference, Rennes - Jan 2023
- Online Learning for Scheduling MIP Heuristics by Antonia Chmiela
SAP-ZIB-FAU workshop, Walldorf - Jan 2023
- Recent Advances in SCIP by Alexander Hoen and Gioni Mexi
SAP-ZIB-FAU workshop, Walldorf - Jan 2023
- Intersection Cuts Meet Submodularity: The Good and the Bad by Liding Xu
Combinatorial Optimization Workshop, Aussois - Jan 2023
- Adaptive Cutting Plane Selection with Analytic Centers by Mathieu Besançon
Combinatorial Optimization Workshop, Aussois - Jan 2023
- Tighter SONC Bounds for Polynomial Optimization Problems with Bounded Variable Domains by Ksenia Bestuzheva
Combinatorial Optimization Workshop, Aussois [PDF] - Jan 2023
- Talk by Antonia Chmiela
Combinatorial Optimization Workshop, Aussois - Nov 2022
- Strengthening Dual Bounds in Branch-and-Bound by SONC Certificates by Ksenia Bestuzheva
Let's SCIP it! (SCIP), Berlin [PDF] - Nov 2022
- Monoidal Strengthening for Intersection Cuts Using Maximal Quadratic-Free Sets by Antonia Chmiela
Let's SCIP it! (SCIP), Berlin - Sep 2022
- Strengthening SONC Relaxations with Constraints Derived From Variable Bounds by Ksenia Bestuzheva
15th HUGO 2022 – XV. Workshop on Global Optimization (HUGO 2022), Szeged [PDF] - Jul 2022
- Feasibility Pump 3.0: Using Multiple Reference Vectors and New Objective Scaling by Gioni Mexi
32nd European Conference on Operational Research (EURO), Espoo - Jul 2022
- New Developments in the SCIP Optimization Suite 8 by Ksenia Bestuzheva
32nd European Conference on Operational Research (EURO), Espoo [PDF] - Oct 2021
- Talk by Antonia Chmiela
INFORMS Annual Meeting (INFORMS), Anaheim - Sep 2021
- Recent Developments in SCIP by Ksenia Bestuzheva
5th ZIB-IMI-ISM-NUS-RIKEN-MODAL Workshop (online) [PDF] - Aug 2021
- Solving MINLPs with SCIP by Ksenia Bestuzheva
22nd IFORS Conference (online) [PDF] - Jul 2021
- A Computational Study Of Perspective Cuts by Ksenia Bestuzheva
31st European Conference on Operational Research (EURO), Athens [PDF] - Jul 2021
- Learning to Schedule Heuristics in Branch and Bound by Antonia Chmiela
31st European Conference on Operational Research (EURO), Athens - Jun 2021
- Reformulation-Linearisation Technique for Implicit Bilinear Relations by Ksenia Bestuzheva
Mixed-Integer Nonlinear Programming Workshop (MINLP) (online) [PDF] - May 2021
- On the Implementation and Strengthening of Intersection Cuts for QCQPs by Antonia Chmiela
22nd IPCO Conference (online) - Jun 2020
- Nonlinear Constraints in SCIP by Ksenia Bestuzheva and Stefan Vigerske
SCIP Workshop (SCIP) (online) [PDF]
Research seminar talks
- Jan 2026
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods by Deborah Hendrych
Department of Mathematics, Singapore - Mar 2025
- Decomposition-Invariant Frank-Wolfe Method in Mixed-Integer Convex Optimization with an Application to Graph Isomorphism by Wenjie Xiao
IOL Research Seminar (IOL), Berlin - Nov 2024
- New Perspectives on Invexity and Its Algorithmic Applications by Ksenia Bestuzheva
Group seminar KTH Royal Institute of Technology, Stockholm - Nov 2024
- A Reformulation-Linearization Technique Framework for Problems with Bilinear Terms by Ksenia Bestuzheva
Discrete Optimization Talks (online) - Nov 2024
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods by Deborah Hendrych
GHOST Research Seminar (GHOST), Grenoble - Oct 2024
- New Perspectives on Invexity and Its Algorithmic Applications by Ksenia Bestuzheva
Laboratoire d'Informatique de Paris-Nord Group Seminar, Paris - Jul 2024
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods by Deborah Hendrych
NASPDE Seminar, Berlin - May 2024
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods by Deborah Hendrych
MATH+ Spotlight talks, Berlin - Dec 2023
- Solving the Optimal Experiment Design Problems with Mixed-Integer Frank-Wolfe-Based Methods by Deborah Hendrych
IOL Research Seminar (IOL), Berlin - Nov 2023
- Constrained Nonlinear Optimization with Frank-Wolfe by Mathieu Besançon
Laboratoire Jean Kuntzmann Seminar, Grenoble - Mar 2023
- Cutting Plane Selection with Analytic Centers by Mathieu Besançon
EDGE Team Seminar, Bordeaux - Mar 2023
- Convex Optimization Techniques for Mixed-Integer Nonlinear Problems by Mathieu Besançon
Département d'Informatique de Polytechnique Seminar, Palaiseau - Feb 2023
- Generalized Benders' Algorithm for Mixed Integer Bilevel Linear Optimization by Suresh Bolusani
Department seminar, Industrial Engineering and Operations Research, IIT Bombay
Summer and winter school lectures
- Sep 2023
- Structured Constrained Nonlinear Optimization with Frank-Wolfe Methods by Mathieu Besançon
MATH+ TES 2023: Summer school, Berlin - Sep 2020
- Mixed-Integer Nonlinear Programming by Ksenia Bestuzheva
4th Computational Optimization at Work (CO@Work) (online) [PDF]
Poster presentations
- Jul 2026
- Recent Improvements on the Integer Frank-Wolfe Framework by Deborah Hendrych
ICOML Conference, Taipei - Jul 2026
- Recent Improvements on the Integer Frank-Wolfe Framework by Deborah Hendrych
8th DOxML Conference, Ookayama - Apr 2026
- Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers by Nico Pelleriti
14th International Conference on Learning Representations (ICLR), Rio de Janeiro - Jul 2025
- Secant Line Search for Frank-Wolfe Algorithms by Deborah Hendrych
42nd International Conference on Machine Learning (ICML), Vancouver - May 2025
- Exploiting Combinatorial Algorithms Within Convex Mixed-Integer Optimization by Deborah Hendrych
7th DOxML Conference, Kyoto - May 2025
- Demystifying Pseudo-Boolean Conflict Analysis Through a MIP Lens by Gioni Mexi
7th DOxML Conference, Kyoto - May 2025
- S-CFE: Simple Counterfactual Explanations by Shpresim Sadiku
28th AISTATS Conference, Phuket - May 2024
- MIP-DD. A Delta Debugger for Mixed Integer Programming Solvers by Alexander Hoen
21st CPAIOR Conference, Uppsala - Apr 2024
- Convex Solver Adaptivity for Mixed-Integer Optimization by Deborah Hendrych
5th Women in Optimization 2024 (WiO), Erlangen - May 2022
- Monoidal Strengthening for Intersection Cuts Using Maximal Quadratic-Free Sets by Antonia Chmiela
19th Mixed Integer Programming Workshop (MIP) (online) - Dec 2021
- Learning to Schedule Heuristics in Branch-and-Bound by Antonia Chmiela
35th conference on neural information processing systems (NeurIPS) (online) - May 2021
- Learning to Schedule Heuristics in Branch-and-Bound by Antonia Chmiela
18th Mixed Integer Programming Workshop (MIP) (online)
Publications and preprints
Preprints and reports
- Sharma, U., Goel, K., Dua, A., Pokutta, S., and Woodstock, Z. (2025). A note on asynchronous projective splitting in Julia.
[URL]
[BibTeX]
@misc{2025_SharmaGoelDuaPokuttaWoodstock_AsyncProx, year = {2025}, month = apr, url = {https://zevwoodstock.github.io/media/publications/asyncprox.pdf}, author = {Sharma, Utkarsh and Goel, Kashish and Dua, Aryan and Pokutta, Sebastian and Woodstock, Zev}, title = {A note on asynchronous projective splitting in Julia} } - 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} } - Bestuzheva, K., Völker, H., and Gleixner, A. (2023). Strengthening SONC Relaxations with Constraints Derived from Variable Bounds (ZIB Report No. 23-03). Zuse Institute Berlin.
[URL]
[arXiv]
[BibTeX]
@techreport{2023_BestuzhevaGleixnerVlker_Soncconstraints, year = {2023}, institution = {Zuse Institute Berlin}, type = {ZIB Report}, month = jan, number = {23-03}, url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-89510}, archiveprefix = {arXiv}, eprint = {2304.12145}, arxiv = {arXiv:2304.12145}, primaryclass = {math.OC}, author = {Bestuzheva, Ksenia and Völker, Helena and Gleixner, Ambros}, title = {Strengthening SONC Relaxations with Constraints Derived from Variable Bounds} } - 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}, arxiv = {arXiv: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 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} } - Xu, L., Liu, Y.-C., and Pokutta, S. (2025). Convex semidefinite tensor optimization and quantum entanglement.
[arXiv]
[BibTeX]
@misc{2025_XuLiuPokutta_Semidefinitetensors_2511-05258, month = nov, archiveprefix = {arXiv}, eprint = {2511.05258}, arxiv = {arXiv:2511.05258}, primaryclass = {math.OC}, author = {Xu, Liding and Liu, Ye-Chao and Pokutta, Sebastian}, title = {Convex semidefinite tensor optimization and quantum entanglement}, date = {2025-11-07} } - Combettes, C., Spiegel, C., and Pokutta, S. (2020). Projection-Free Adaptive Gradients for Large-Scale Optimization.
[arXiv]
[summary]
[code]
[BibTeX]
@misc{2020_CombettesSpiegelPokutta_Projectionfreeadaptivegradients, archiveprefix = {arXiv}, eprint = {2009.14114}, arxiv = {arXiv:2009.14114}, primaryclass = {math.OC}, author = {Combettes, Cyrille and Spiegel, Christoph and Pokutta, Sebastian}, title = {Projection-Free Adaptive Gradients for Large-Scale Optimization}, code = {https://github.com/ZIB-IOL/StochasticFrankWolfe}, summary = {https://pokutta.com/blog/research/2020/10/21/adasfw.html}, date = {2020-09-29} } - Pokutta, S., Spiegel, C., and Zimmer, M. (2020). Deep Neural Network Training with Frank-Wolfe.
[arXiv]
[summary]
[code]
[BibTeX]
@misc{2020_PokuttaSpiegelZimmer_Frankwolfeneuralnetworks, archiveprefix = {arXiv}, eprint = {2010.07243}, arxiv = {arXiv:2010.07243}, primaryclass = {cs.LG}, author = {Pokutta, Sebastian and Spiegel, Christoph and Zimmer, Max}, title = {Deep Neural Network Training with Frank-Wolfe}, code = {https://github.com/ZIB-IOL/StochasticFrankWolfe}, summary = {https://pokutta.com/blog/research/2020/11/11/NNFW.html}, date = {2020-10-14} } - Braun, G., and Pokutta, S. (2021). Dual Prices for Frank–Wolfe Algorithms.
[arXiv]
[BibTeX]
@misc{2021_BraunPokutta_DualpricesFrankwolfe, archiveprefix = {arXiv}, eprint = {2101.02087}, arxiv = {arXiv:2101.02087}, primaryclass = {math.OC}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {Dual Prices for Frank--Wolfe Algorithms}, date = {2021-01-06} } - 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}, arxiv = {arXiv:2311.03877}, primaryclass = {math.OC}, 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} } - 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}, arxiv = {arXiv:2306.06050}, primaryclass = {math.OC}, 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-09} } - 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}, arxiv = {arXiv:2403.13567}, primaryclass = {math.OC}, 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} } - 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} } - Sharma, K., Hendrych, D., Besançon, M., and Pokutta, S. (2024). Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe.
[arXiv]
[BibTeX]
@misc{2024_SharmaHendrychBesanconPokutta_NetworkdesignMicoFrankwolfe, archiveprefix = {arXiv}, eprint = {2402.00166}, arxiv = {arXiv: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} } - 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} } - Dionísio, J., Gleixner, A., Pedroso, J. P., and Bestuzheva, K. (2025). Branch and price for nonlinear production-maintenance scheduling in complex machinery.
[arXiv]
[BibTeX]
@misc{2025_DionisioGleixnerPedrosoBestuzheva_Branchpricescheduling_2511-07143, archiveprefix = {arXiv}, eprint = {2511.07143}, arxiv = {arXiv:2511.07143}, primaryclass = {math.OC}, author = {Dionísio, João and Gleixner, Ambros and Pedroso, João Pedro and Bestuzheva, Ksenia}, title = {Branch and price for nonlinear production-maintenance scheduling in complex machinery}, date = {2025-11-10} } - Aigner, K.-M., Denzler, S., Liers, F., Pokutta, S., and Sharma, K. (2025). Scenario Reduction for Distributionally Robust Optimization.
[arXiv]
[BibTeX]
@misc{2025_Kevin-martinEtAl_ScenarioreductionDro, archiveprefix = {arXiv}, eprint = {2503.11484}, arxiv = {arXiv:2503.11484}, primaryclass = {math.OC}, author = {Aigner, Kevin-Martin and Denzler, Sebastian and Liers, Frauke and Pokutta, Sebastian and Sharma, Kartikey}, title = {Scenario Reduction for Distributionally Robust Optimization}, date = {2025-03-14} } - 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} } - Martínez-Rubio, D., and Pokutta, S. (2025). Beyond Short Steps in Frank-Wolfe Algorithms.
[arXiv]
[BibTeX]
@misc{2025_MartinezrubioPokutta_FrankwolfeEnhancements, archiveprefix = {arXiv}, eprint = {2501.18773}, arxiv = {arXiv:2501.18773}, primaryclass = {math.OC}, author = {Martínez-Rubio, David and Pokutta, Sebastian}, title = {Beyond Short Steps in Frank-Wolfe Algorithms}, date = {2025-01-30} } - 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} } - Pokutta, S. (2025). Scalable DC Optimization via Adaptive Frank-Wolfe Algorithms.
[arXiv]
[BibTeX]
@misc{2025_Pokutta_DcoptimizationFrankwolfe_2507-17545, archiveprefix = {arXiv}, eprint = {2507.17545}, arxiv = {arXiv:2507.17545}, primaryclass = {math.OC}, author = {Pokutta, Sebastian}, title = {Scalable DC Optimization via Adaptive Frank-Wolfe Algorithms}, date = {2025-07-23} } - Sadiku, S., Chitranshi, K., Kera, H., and Pokutta, S. (2025). Training on Plausible Counterfactuals Removes Spurious Correlations.
[arXiv]
[BibTeX]
@misc{2025_SadikuChitranshiKeraPokutta_Plausiblecounterfactuals, archiveprefix = {arXiv}, eprint = {2505.16583}, arxiv = {arXiv:2505.16583}, primaryclass = {cs.LG}, author = {Sadiku, Shpresim and Chitranshi, Kartikeya and Kera, Hiroshi and Pokutta, Sebastian}, title = {Training on Plausible Counterfactuals Removes Spurious Correlations}, date = {2025-05-22} } - von Holly-Ponientzietz, J., Hoen, A., Turner, M., and Gleixner, A. (2025). Clique Probing for Mixed-Integer Programs.
[arXiv]
[BibTeX]
@misc{2025_VonhollyponientzietzHoenTurnerGleixner_Cliqueprobing_2512-17551, archiveprefix = {arXiv}, eprint = {2512.17551}, arxiv = {arXiv:2512.17551}, primaryclass = {math.OC}, author = {von Holly-Ponientzietz, Jacob and Hoen, Alexander and Turner, Mark and Gleixner, Ambros}, title = {Clique Probing for Mixed-Integer Programs}, date = {2025-12-19} } - Xiao, W., Hendrych, D., Besançon, M., and Pokutta, S. (2025). Boscia.jl: A review and tutorial.
[arXiv]
[BibTeX]
@misc{2025_XiaoHendrychBesanconPokutta_Bosciaminlp_2511-01479, archiveprefix = {arXiv}, eprint = {2511.01479}, arxiv = {arXiv:2511.01479}, primaryclass = {math.OC}, author = {Xiao, Wenjie and Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian}, title = {Boscia.jl: A review and tutorial}, date = {2025-11-03} } - 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} } - 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} } - 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} } - Hendrych, D., Besançon, M., and Pokutta, S. (2026). Discrete eigenvalue optimization from entropic smoothing and first-order methods.
[arXiv]
[code]
[BibTeX]
@misc{2026_HendrychBesanconPokutta_DiscreteEigenvalueOptimization_2608-27024, archiveprefix = {arXiv}, eprint = {2608.27024}, arxiv = {arXiv:2608.27024}, primaryclass = {math.OC}, author = {Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian}, title = {Discrete eigenvalue optimization from entropic smoothing and first-order methods}, code = {https://github.com/ZIB-IOL/OptimalDesignWithBoscia}, date = {2026-08-27} } - 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} } - Xu, L., and Pokutta, S. (2026). Joint-Range Inequalities for Nonconvex QCQPs.
[arXiv]
[BibTeX]
@misc{2026_XuPokutta_Jointrangeinequalities_2608-03318, archiveprefix = {arXiv}, eprint = {2608.03318}, arxiv = {arXiv:2608.03318}, primaryclass = {math.OC}, author = {Xu, Liding and Pokutta, Sebastian}, title = {Joint-Range Inequalities for Nonconvex QCQPs}, date = {2026-08-04} }
Conference contributions
- 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} } - Felloussi, M., Ghannam, M., Dionísio, J., Gianessi, P., and Delorme, X. (2027). Branch and Price for Job-Shop Scheduling with Time-Dependent Costs and Cardinality Resource Constraints. Combinatorial Optimization, 16613, 81–94.
Associated with ISCO 2026.
DOI: 10.1007/978-3-032-34519-6_7
[BibTeX]
@inproceedings{2026_FelloussiEtAl_Branchpricejobshop, year = {2027}, booktitle = {Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {16613}, publisher = {Springer Science+Business Media}, pages = {81--94}, doi = {10.1007/978-3-032-34519-6_7}, author = {Felloussi, Marouane and Ghannam, Mohammed and Dionísio, João and Gianessi, Paolo and Delorme, Xavier}, title = {Branch and Price for Job-Shop Scheduling with Time-Dependent Costs and Cardinality Resource Constraints} } - Iommazzo, G., Martínez-Rubio, D., Criado, F., Wirth, E., and Pokutta, S. (2026). Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes. Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, 300.
Associated with AISTATS 2026.
[arXiv]
[BibTeX]
@inproceedings{2025_IommazzoEtAl_Frankwolfeconvergence, year = {2026}, booktitle = {Proceedings of The 29th International Conference on Artificial Intelligence and Statistics}, series = {Proceedings of Machine Learning Research}, volume = {300}, archiveprefix = {arXiv}, eprint = {2505.11259}, arxiv = {arXiv:2505.11259}, primaryclass = {math.OC}, author = {Iommazzo, Gabriele and Martínez-Rubio, David and Criado, Francisco and Wirth, Elias and Pokutta, Sebastian}, title = {Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes} } - Pelleriti, N., Spiegel, C., Liu, S., Martínez-Rubio, D., Zimmer, M., and Pokutta, S. (2026). Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers. International Conference on Learning Representations 2026.
Associated with ICLR 2026.
[URL]
[arXiv]
[BibTeX]
@inproceedings{2025_PelleritiEtAl_Neuralsos_2510-13444, year = {2026}, booktitle = {International Conference on Learning Representations 2026}, publisher = {ICLR (OpenReview)}, url = {https://proceedings.iclr.cc/paper_files/paper/2026/hash/1cfb3b066461f1c542be5242a622ce4b-Abstract-Conference.html}, archiveprefix = {arXiv}, eprint = {2510.13444}, arxiv = {arXiv:2510.13444}, primaryclass = {cs.LG}, author = {Pelleriti, Nico and Spiegel, Christoph and Liu, Shiwei and Martínez-Rubio, David and Zimmer, Max and Pokutta, Sebastian}, title = {Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers} } - Xiao, W., Besançon, M., Gelß, P., Hendrych, D., Klus, S., and Pokutta, S. (2026). Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 16595, 614–630.
Associated with CPAIOR 2026.
DOI: 10.1007/978-3-032-27242-3_36
[arXiv]
[BibTeX]
@inproceedings{2025_XiaoEtAl_GraphisomorphismOptimization_2512-17417, year = {2026}, booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research}, series = {Lecture Notes in Computer Science}, volume = {16595}, publisher = {Springer Science+Business Media}, pages = {614--630}, doi = {10.1007/978-3-032-27242-3_36}, archiveprefix = {arXiv}, eprint = {2512.17417}, arxiv = {arXiv:2512.17417}, primaryclass = {math.OC}, author = {Xiao, Wenjie and Besançon, Mathieu and Gelß, Patrick and Hendrych, Deborah and Klus, Stefan and Pokutta, Sebastian}, title = {Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods} } - Hendrych, D., Besançon, M., Martínez-Rubio, D., and Pokutta, S. (2025). Secant Line Search for Frank-Wolfe Algorithms. Proceedings of the 42nd International Conference on Machine Learning, 267.
Associated with ICML 2025.
[arXiv]
[BibTeX]
@inproceedings{2025_HendrychBesanconMartinezrubioPokutta_Secantfrankwolfe, year = {2025}, booktitle = {Proceedings of the 42nd International Conference on Machine Learning}, series = {Proceedings of Machine Learning Research}, volume = {267}, month = may, archiveprefix = {arXiv}, eprint = {2501.18775}, arxiv = {arXiv:2501.18775}, primaryclass = {math.OC}, author = {Hendrych, Deborah and Besançon, Mathieu and Martínez-Rubio, David and Pokutta, Sebastian}, title = {Secant Line Search for Frank-Wolfe Algorithms} } - Roux, C., Martínez-Rubio, D., and Pokutta, S. (2025). Implicit Riemannian Optimism with Applications to Min-Max Problems. Proceedings of the 42nd International Conference on Machine Learning, 267, 52139–52172.
Associated with ICML 2025.
[arXiv]
[BibTeX]
@inproceedings{2025_RouxMartinezrubioPokutta_ImplicitRiemannian, year = {2025}, booktitle = {Proceedings of the 42nd International Conference on Machine Learning}, series = {Proceedings of Machine Learning Research}, volume = {267}, month = may, pages = {52139--52172}, archiveprefix = {arXiv}, eprint = {2501.18381}, arxiv = {arXiv:2501.18381}, primaryclass = {math.OC}, author = {Roux, Christophe and Martínez-Rubio, David and Pokutta, Sebastian}, title = {Implicit Riemannian Optimism with Applications to Min-Max Problems} } - Troppens, H., Besançon, M., Wilken, S. E., and Pokutta, S. (2025). Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks. 23rd International Symposium on Experimental Algorithms (SEA 2025), 338, 26:1–26:18.
Associated with SEA 2025.
DOI: 10.4230/LIPIcs.SEA.2025.26
[arXiv]
[BibTeX]
@inproceedings{2025_TroppensBesanconWilkenPokutta_Mixedintegerloopless, year = {2025}, booktitle = {23rd International Symposium on Experimental Algorithms (SEA 2025)}, series = {Leibniz International Proceedings in Informatics}, volume = {338}, publisher = {Schloss Dagstuhl – Leibniz Center for Informatics}, month = apr, pages = {26:1--26:18}, doi = {10.4230/LIPIcs.SEA.2025.26}, archiveprefix = {arXiv}, eprint = {2502.00807}, arxiv = {arXiv:2502.00807}, primaryclass = {math.OC}, 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} } - Martínez-Rubio, D., Roux, C., Criscitiello, C., and Pokutta, S. (2025). Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties. Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, 258, 280–288.
Associated with AISTATS 2025.
[arXiv]
[BibTeX]
@inproceedings{2023_MartinezrubioRouxCriscitielloPokutta_Riemannianminmax, year = {2025}, booktitle = {Proceedings of The 28th International Conference on Artificial Intelligence and Statistics}, series = {Proceedings of Machine Learning Research}, volume = {258}, month = jan, pages = {280--288}, archiveprefix = {arXiv}, eprint = {2305.16186}, arxiv = {arXiv:2305.16186}, primaryclass = {math.OC}, author = {Martínez-Rubio, David and Roux, Christophe and Criscitiello, Christopher and Pokutta, Sebastian}, title = {Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties} } - Sadiku, S., Wagner, M., and Pokutta, S. (2025, January). GSE: Group-wise Sparse and Explainable Adversarial Attacks. International Conference on Learning Representations 2025.
Associated with ICLR 2025.
[arXiv]
[BibTeX]
@inproceedings{2023_SadikuWagnerPokutta_Groupwisesparseattacks, year = {2025}, booktitle = {International Conference on Learning Representations 2025}, publisher = {ICLR (OpenReview)}, month = jan, archiveprefix = {arXiv}, eprint = {2311.17434}, arxiv = {arXiv:2311.17434}, primaryclass = {cs.CV}, author = {Sadiku, Shpresim and Wagner, Moritz and Pokutta, Sebastian}, title = {GSE: Group-wise Sparse and Explainable Adversarial Attacks} } - Sadiku, S., Wagner, M., Nagarajan, S. G., and Pokutta, S. (2025). S-CFE: Simple Counterfactual Explanations. Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, 258.
Associated with AISTATS 2025.
[arXiv]
[BibTeX]
@inproceedings{2024_SadikuEtAl_Counterfactualexplanations, year = {2025}, booktitle = {Proceedings of The 28th International Conference on Artificial Intelligence and Statistics}, series = {Proceedings of Machine Learning Research}, volume = {258}, month = jan, archiveprefix = {arXiv}, eprint = {2410.15723}, arxiv = {arXiv:2410.15723}, primaryclass = {cs.LG}, author = {Sadiku, Shpresim and Wagner, Moritz and Nagarajan, Sai Ganesh and Pokutta, Sebastian}, title = {S-CFE: Simple Counterfactual Explanations} } - Ghannam, M., and Gleixner, A. (2025). Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows. Operations Research Proceedings 2023, 273–280.
Associated with OR 2023.
DOI: 10.1007/978-3-031-58405-3_35
[arXiv]
[BibTeX]
@inproceedings{2023_GhannamGleixner_Hybridgeneticsearch, year = {2025}, booktitle = {Operations Research Proceedings 2023}, series = {Lecture Notes in Operations Research}, publisher = {Springer Science+Business Media}, pages = {273--280}, doi = {10.1007/978-3-031-58405-3_35}, archiveprefix = {arXiv}, eprint = {2307.11800}, arxiv = {arXiv:2307.11800}, primaryclass = {cs.NE}, author = {Ghannam, Mohammed and Gleixner, Ambros}, title = {Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows} } - 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} } - Turner, M., Berthold, T., and Besançon, M. (2025). A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. Operations Research Proceedings 2023, 217–224.
Associated with OR 2023.
DOI: 10.1007/978-3-031-58405-3_28
[arXiv]
[BibTeX]
@inproceedings{2023_TurnerBertholdBesancon_Contextawarecuttingplane, year = {2025}, booktitle = {Operations Research Proceedings 2023}, series = {Lecture Notes in Operations Research}, publisher = {Springer Science+Business Media}, pages = {217--224}, doi = {10.1007/978-3-031-58405-3_28}, archiveprefix = {arXiv}, eprint = {2307.07322}, arxiv = {arXiv: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} } - Turner, M., Chmiela, A., Koch, T., and Winkler, M. (2025). PySCIPOpt-ML: Embedding Trained Machine Learning Models into Mixed-Integer Programs. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 15763, 218–234.
Associated with CPAIOR 2025.
DOI: 10.1007/978-3-031-95976-9_14
[arXiv]
[BibTeX]
@inproceedings{2023_TurnerChmielaKochMichael_Pyscipoptml, year = {2025}, date = {2025-06-29}, booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research}, series = {Lecture Notes in Computer Science}, volume = {15763}, publisher = {Springer Science+Business Media}, pages = {218--234}, doi = {10.1007/978-3-031-95976-9_14}, archiveprefix = {arXiv}, eprint = {2312.08074}, arxiv = {arXiv:2312.08074}, primaryclass = {math.OC}, author = {Turner, Mark and Chmiela, Antonia and Koch, Thorsten and Winkler, Michael}, title = {PySCIPOpt-ML: Embedding Trained Machine Learning Models into Mixed-Integer Programs} } - 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} } - Hoen, A., and Gleixner, A. (2025). Analyzing the Numerical Correctness of Branch-and-Bound Decisions for Mixed-Integer Programming. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 15763, 35–50.
Associated with CPAIOR 2025.
DOI: 10.1007/978-3-031-95976-9_3
[URL]
[arXiv]
[BibTeX]
@inproceedings{2024_HoenGleixner_NumericalCorrectnessBnB, year = {2025}, date = {2025-06-29}, booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research}, series = {Lecture Notes in Computer Science}, volume = {15763}, publisher = {Springer Science+Business Media}, pages = {35--50}, doi = {10.1007/978-3-031-95976-9_3}, url = {https://link.springer.com/chapter/10.1007/978-3-031-95976-9_3}, archiveprefix = {arXiv}, eprint = {2412.14710}, arxiv = {arXiv:2412.14710}, primaryclass = {math.OC}, author = {Hoen, Alexander and Gleixner, Ambros}, title = {Analyzing the Numerical Correctness of Branch-and-Bound Decisions for Mixed-Integer Programming} } - 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} } - Hendrych, D., Besançon, M., and Pokutta, S. (2024). Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods. 22nd International Symposium on Experimental Algorithms (SEA 2024), 301, 16:1–16:22.
Associated with SEA 2024.
DOI: 10.4230/LIPIcs.SEA.2024.16
[arXiv]
[code]
[BibTeX]
@inproceedings{2023_HendrychBesanconPokutta_Optimalexperimentdesign, year = {2024}, booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)}, series = {Leibniz International Proceedings in Informatics}, volume = {301}, publisher = {Schloss Dagstuhl – Leibniz Center for Informatics}, month = apr, pages = {16:1--16:22}, doi = {10.4230/LIPIcs.SEA.2024.16}, archiveprefix = {arXiv}, eprint = {2312.11200}, arxiv = {arXiv: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} } - 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} } - Eifler, L., Witzig, J., and Gleixner, A. (2024). Branch and Cut for Partitioning a Graph into a Cycle of Clusters. Combinatorial Optimization, 14594, 97–108.
Associated with ISCO 2024.
DOI: 10.1007/978-3-031-60924-4_8
[arXiv]
[BibTeX]
@inproceedings{2024_EiflerWitzigGleixner_Branchcutcycleclustering, year = {2024}, date = {2024-05-22}, booktitle = {Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {14594}, publisher = {Springer Science+Business Media}, pages = {97--108}, doi = {10.1007/978-3-031-60924-4_8}, archiveprefix = {arXiv}, eprint = {2401.08412}, arxiv = {arXiv: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} } - 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} } - Hoen, A., Oertel, A., Gleixner, A., and Nordström, J. (2024). Certifying MIP-Based Presolve Reductions for 0–1 Integer Linear Programs. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 14742, 310–328.
Associated with CPAIOR 2024.
DOI: 10.1007/978-3-031-60597-0_20
[arXiv]
[BibTeX]
@inproceedings{2024_HoenOertelGleixnerNordstrm_Mippresolvecertification, year = {2024}, date = {2024-05-25}, booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research}, series = {Lecture Notes in Computer Science}, volume = {14742}, publisher = {Springer Science+Business Media}, pages = {310--328}, doi = {10.1007/978-3-031-60597-0_20}, archiveprefix = {arXiv}, eprint = {2401.09277}, arxiv = {arXiv: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} } - Martínez-Rubio, D., Roux, C., and Pokutta, S. (2024). Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point. Proceedings of the 41st International Conference on Machine Learning, 235.
Associated with ICML 2024.
[URL]
[arXiv]
[BibTeX]
@inproceedings{2024_MartinezrubioRouxPokutta_Riemanniangradientdescent, year = {2024}, booktitle = {Proceedings of the 41st International Conference on Machine Learning}, series = {Proceedings of Machine Learning Research}, volume = {235}, url = {https://proceedings.mlr.press/v235/marti-nez-rubio24a.html}, archiveprefix = {arXiv}, eprint = {2403.10429}, arxiv = {arXiv:2403.10429}, primaryclass = {math.OC}, author = {Martínez-Rubio, David and Roux, Christophe and Pokutta, Sebastian}, title = {Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point} } - Sharma, K., Hendrych, D., Besançon, M., and Pokutta, S. (2024). Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe. Accepted at INFORMS Optimization Society Conference.
[arXiv]
[BibTeX]
@misc{2024_SharmaHendrychBesanconPokutta_NetworkdesignMicoFrankwolfe:1, howpublished = {Accepted at INFORMS Optimization Society Conference}, year = {2024}, archiveprefix = {arXiv}, eprint = {2402.00166}, arxiv = {arXiv: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} } - Thuerck, D., Sofranac, B., Pfetsch, M., and Pokutta, S. (2023). Learning Cuts via Enumeration Oracles. Advances in Neural Information Processing Systems, 36, 79108–79123.
Associated with NeurIPS 2023.
DOI: 10.52202/075280-3461
[arXiv]
[BibTeX]
@inproceedings{2023_ThuerckSofranacPfetschPokutta_Learningcutsenumeration, year = {2023}, booktitle = {Advances in Neural Information Processing Systems}, series = {Advances in Neural Information Processing Systems}, volume = {36}, publisher = {Curran Associates}, month = sep, pages = {79108--79123}, doi = {10.52202/075280-3461}, archiveprefix = {arXiv}, eprint = {2305.12197}, arxiv = {arXiv:2305.12197}, primaryclass = {math.OC}, author = {Thuerck, Daniel and Sofranac, Boro and Pfetsch, Marc and Pokutta, Sebastian}, title = {Learning Cuts via Enumeration Oracles} } - Chmiela, A., Gleixner, A., Lichocki, P., and Pokutta, S. (2023). Online Learning for Scheduling MIP Heuristics. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 13884, 114–123.
Associated with CPAIOR 2023.
DOI: 10.1007/978-3-031-33271-5_8
[arXiv]
[BibTeX]
@inproceedings{2023_ChmielaGleixnerLichockiPokutta_Onlinelearningscheduling, year = {2023}, date = {2023-05-23}, booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research}, series = {Lecture Notes in Computer Science}, volume = {13884}, publisher = {Springer Science+Business Media}, month = may, pages = {114--123}, doi = {10.1007/978-3-031-33271-5_8}, archiveprefix = {arXiv}, eprint = {2304.03755}, arxiv = {arXiv:2304.03755}, primaryclass = {math.OC}, author = {Chmiela, Antonia and Gleixner, Ambros and Lichocki, Pawel and Pokutta, Sebastian}, title = {Online Learning for Scheduling MIP Heuristics} } - Martínez-Rubio, D., Roux, C., Criscitiello, C., and Pokutta, S. (2023). Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties. Accepted at Optimization for Machine Learning.
[arXiv]
[BibTeX]
@misc{2023_MartinezrubioRouxCriscitielloPokutta_Riemannianminmax:1, howpublished = {Accepted at Optimization for Machine Learning}, year = {2023}, month = may, archiveprefix = {arXiv}, eprint = {2305.16186}, arxiv = {arXiv:2305.16186}, primaryclass = {math.OC}, author = {Martínez-Rubio, David and Roux, Christophe and Criscitiello, Christopher and Pokutta, Sebastian}, title = {Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties} } - Bestuzheva, K., Gleixner, A., and Achterberg, T. (2023). Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. Integer Programming and Combinatorial Optimization, 13904, 14–28.
Associated with IPCO 2023.
DOI: 10.1007/978-3-031-32726-1_2
[arXiv]
[BibTeX]
@inproceedings{2022_BestuzhevaGleixnerAchterberg_Rltcutsbilinear:1, year = {2023}, date = {2023-05-22}, booktitle = {Integer Programming and Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {13904}, publisher = {Springer Science+Business Media}, pages = {14--28}, doi = {10.1007/978-3-031-32726-1_2}, archiveprefix = {arXiv}, eprint = {2211.13545}, arxiv = {arXiv: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} } - Turner, M., Berthold, T., Besançon, M., and Koch, T. (2023). Cutting Plane Selection with Analytic Centers and Multiregression. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 13884, 52–68.
Associated with CPAIOR 2023.
DOI: 10.1007/978-3-031-33271-5_4
[arXiv]
[BibTeX]
@inproceedings{2022_TurnerBertholdBesanconKoch_Cuttingplanemultiregression, year = {2023}, booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research}, series = {Lecture Notes in Computer Science}, volume = {13884}, publisher = {Springer Science+Business Media}, pages = {52--68}, doi = {10.1007/978-3-031-33271-5_4}, archiveprefix = {arXiv}, eprint = {2212.07231}, arxiv = {arXiv: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} } - Chmiela, A., Muñoz, G., and Serrano, F. (2023). Monoidal Strengthening and Unique Lifting in MIQCPs. Integer Programming and Combinatorial Optimization, 13904, 87–99.
Associated with IPCO 2023.
DOI: 10.1007/978-3-031-32726-1_7
[URL]
[BibTeX]
@inproceedings{2023_ChmielaMuozSerrano_Monoidalstrengthening:1, year = {2023}, date = {2023-01-01}, booktitle = {Integer Programming and Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {13904}, publisher = {Springer Science+Business Media}, pages = {87--99}, doi = {10.1007/978-3-031-32726-1_7}, url = {https://gonzalomunoz.org/monoidalforMIQCP.pdf}, author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe}, title = {Monoidal Strengthening and Unique Lifting in MIQCPs} } - 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} } - 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., Morris, C., Papageorgiou, D. J., Parjadis, A., Pokutta, S., … Kun, M. (2022). The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track, 176, 220–231.
[URL]
[arXiv]
[BibTeX]
@inproceedings{2022_GasseEtAl_Ml4coinsights, year = {2022}, booktitle = {Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track}, series = {Proceedings of Machine Learning Research}, volume = {176}, month = jun, pages = {220--231}, url = {https://proceedings.mlr.press/v176/gasse22a.html}, archiveprefix = {arXiv}, eprint = {2203.02433}, arxiv = {arXiv: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 Morris, Christopher 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} } - Macdonald, J., Besançon, M., and Pokutta, S. (2022). Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings. Proceedings of the 39th International Conference on Machine Learning, 162.
Associated with ICML 2022.
[arXiv]
[poster]
[video]
[BibTeX]
@inproceedings{2021_MacdonaldBesanconPokutta_Interpretableneuralnetworks, year = {2022}, booktitle = {Proceedings of the 39th International Conference on Machine Learning}, series = {Proceedings of Machine Learning Research}, volume = {162}, month = may, archiveprefix = {arXiv}, eprint = {2110.08105}, arxiv = {arXiv:2110.08105}, primaryclass = {cs.LG}, author = {Macdonald, Jan and Besançon, Mathieu and Pokutta, Sebastian}, title = {Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings}, poster = {https://pokutta.com/slides/20220712_icml_poster_interpretable_rde.pdf}, video = {https://slideslive.com/38983588} } - Bestuzheva, K., Gleixner, A., and Völker, H. (2022). Strengthening SONC Relaxations with Constraints Derived from Variable Bounds. Proceedings of the Hungarian Global Optimization Workshop HUGO 2022, 41–44.
Associated with STOGO 2022.
[URL]
[arXiv]
[BibTeX]
@inproceedings{2022_BestuzhevaGleixnerVoelker_Soncconstraints_2211-05518, year = {2022}, booktitle = {Proceedings of the Hungarian Global Optimization Workshop HUGO 2022}, publisher = {University of Szeged}, pages = {41--44}, note = {ZIB report 22-23}, url = {https://inf.u-szeged.hu/hugo/}, archiveprefix = {arXiv}, eprint = {2211.05518}, arxiv = {arXiv:2211.05518}, primaryclass = {math.OC}, author = {Bestuzheva, Ksenia and Gleixner, Ambros and Völker, Helena}, title = {Strengthening SONC Relaxations with Constraints Derived from Variable Bounds} } - Sofranac, B., Gleixner, A., and Pokutta, S. (2021). An Algorithm-Independent Measure of Progress for Linear Constraint Propagation. 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), 210, 52:1–52:17.
Associated with CP 2021.
DOI: 10.4230/LIPIcs.CP.2021.52
[URL]
[arXiv]
[video]
[BibTeX]
@inproceedings{2021_SofranacGleixnerPokutta_Progressmeasure:1, year = {2021}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, series = {Leibniz International Proceedings in Informatics}, volume = {210}, publisher = {Schloss Dagstuhl – Leibniz Center for Informatics}, month = jun, pages = {52:1--52:17}, doi = {10.4230/LIPIcs.CP.2021.52}, url = {https://drops.dagstuhl.de/opus/volltexte/2021/15343/}, archiveprefix = {arXiv}, eprint = {2106.07573}, arxiv = {arXiv: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} } - Carderera, A., Besançon, M., and Pokutta, S. (2021). Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions. Advances in Neural Information Processing Systems, 34, 5390–5401.
Associated with NeurIPS 2021.
[URL]
[arXiv]
[summary]
[slides]
[poster]
[code]
[BibTeX]
@inproceedings{2024_CardereraBesanconPokutta_Scalablefrankwolfe:1, year = {2021}, booktitle = {Advances in Neural Information Processing Systems}, series = {Advances in Neural Information Processing Systems}, volume = {34}, publisher = {Curran Associates}, month = may, pages = {5390--5401}, url = {https://proceedings.neurips.cc/paper_files/paper/2021/file/2b323d6eb28422cef49b266557dd31ad-Paper.pdf}, archiveprefix = {arXiv}, eprint = {2105.13913}, arxiv = {arXiv:2105.13913}, primaryclass = {math.OC}, author = {Carderera, Alejandro and Besançon, Mathieu and Pokutta, Sebastian}, title = {Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions}, code = {https://doi.org/10.5281/zenodo.4836009}, poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_lSimple_steps_are_all_you_need.pdf}, slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf}, summary = {https://pokutta.com/blog/research/2021/10/09/self-concordant-abstract.html} } - Chmiela, A., Khalil, E. B., Gleixner, A., Lodi, A., and Pokutta, S. (2021). Learning to Schedule Heuristics in Branch-and-Bound. Advances in Neural Information Processing Systems, 34, 24235–24246.
Associated with NeurIPS 2021.
[URL]
[arXiv]
[poster]
[BibTeX]
@inproceedings{2021_ChmielaEtAl_Heuristicscheduling, year = {2021}, booktitle = {Advances in Neural Information Processing Systems}, series = {Advances in Neural Information Processing Systems}, volume = {34}, publisher = {Curran Associates}, month = mar, pages = {24235--24246}, url = {https://proceedings.neurips.cc/paper_files/paper/2021/file/cb7c403aa312160380010ee3dd4bfc53-Paper.pdf}, archiveprefix = {arXiv}, eprint = {2103.10294}, arxiv = {arXiv: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} } - Carderera, A., Diakonikolas, J., Lin, C. Y., and Pokutta, S. (2021). Parameter-free Locally Accelerated Conditional Gradients. Proceedings of the 38th International Conference on Machine Learning, 139.
Associated with ICML 2021.
[arXiv]
[slides]
[BibTeX]
@inproceedings{2021_CardereraDiakonikolasLinPokutta_ParameterfreeLocallyAccelerated, year = {2021}, booktitle = {Proceedings of the 38th International Conference on Machine Learning}, series = {Proceedings of Machine Learning Research}, volume = {139}, month = feb, archiveprefix = {arXiv}, eprint = {2102.06806}, arxiv = {arXiv:2102.06806}, primaryclass = {math.OC}, author = {Carderera, Alejandro and Diakonikolas, Jelena and Lin, Cheuk Yin and Pokutta, Sebastian}, title = {Parameter-free Locally Accelerated Conditional Gradients}, slides = {https://pokutta.com/slides/20210716_PF_LaCG_Poster.pdf} } - Chmiela, A., Muñoz, G., and Serrano, F. (2021). On the Implementation and Strengthening of Intersection Cuts for QCQPs. Integer Programming and Combinatorial Optimization, 12707, 134–147.
Associated with IPCO 2021.
DOI: 10.1007/978-3-030-73879-2_10
[URL]
[BibTeX]
@inproceedings{2022_ChmielaMuozSerrano_Intersectioncutsqcqps:1, year = {2021}, booktitle = {Integer Programming and Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {12707}, publisher = {Springer Science+Business Media}, pages = {134--147}, doi = {10.1007/978-3-030-73879-2_10}, note = {ZIB report 20-29}, url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-79994}, author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe}, title = {On the Implementation and Strengthening of Intersection Cuts for QCQPs} } - Eifler, L., and Gleixner, A. (2021). A computational status update for exact rational mixed integer programming. Integer Programming and Combinatorial Optimization, 12707, 163–177.
Associated with IPCO 2021.
DOI: 10.1007/978-3-030-73879-2_12
[URL]
[arXiv]
[BibTeX]
@inproceedings{2023_EiflerGleixner_Exactrationalmip:1, year = {2021}, booktitle = {Integer Programming and Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {12707}, publisher = {Springer Science+Business Media}, pages = {163--177}, doi = {10.1007/978-3-030-73879-2_12}, note = {ZIB report 21-04}, url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-81298}, archiveprefix = {arXiv}, eprint = {2101.09141}, arxiv = {arXiv:2101.09141}, primaryclass = {math.OC}, author = {Eifler, Leon and Gleixner, Ambros}, title = {A computational status update for exact rational mixed integer programming} } - Sofranac, B., Gleixner, A., and Pokutta, S. (2020). Accelerating Domain Propagation: An Efficient GPU-Parallel Algorithm over Sparse Matrices. 2020 IEEE/ACM 10th Workshop on Irregular Applications: Architectures and Algorithms (IA3), 1–11.
DOI: 10.1109/IA351965.2020.00007
[arXiv]
[summary]
[slides]
[video]
[BibTeX]
@inproceedings{2020_SofranacGleixnerPokutta_Domainpropagation:1, year = {2020}, booktitle = {2020 IEEE/ACM 10th Workshop on Irregular Applications: Architectures and Algorithms (IA3)}, publisher = {Institute of Electrical and Electronics Engineers}, month = sep, pages = {1--11}, doi = {10.1109/IA351965.2020.00007}, archiveprefix = {arXiv}, eprint = {2009.07785}, arxiv = {arXiv: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} } - Mortagy, H., Gupta, S., and Pokutta, S. (2020). Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization. Advances in Neural Information Processing Systems, 33.
Associated with NeurIPS 2020.
[arXiv]
[slides]
[code]
[video]
[BibTeX]
@inproceedings{2020_MortagyGuptaPokutta_WalkingShadow, year = {2020}, booktitle = {Advances in Neural Information Processing Systems}, series = {Advances in Neural Information Processing Systems}, volume = {33}, publisher = {Curran Associates}, month = jun, archiveprefix = {arXiv}, eprint = {2006.08426}, arxiv = {arXiv:2006.08426}, primaryclass = {math.OC}, author = {Mortagy, Hassan and Gupta, Swati and Pokutta, Sebastian}, title = {Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization}, code = {https://github.com/pokutta/Walking-in-the-Shadow}, slides = {https://app.box.com/s/wjhpe4nh8kv5pw6vl5jbp902v3mksivs}, video = {https://youtu.be/CRmASevfnmE} }
Articles, chapters and books
- 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} } - Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2026). Local and Global Uniform Convexity Conditions. In Data Science and Optimization (Vol. 91, pp. 85–120). Springer Science+Business Media.
DOI: 10.1007/978-3-032-03844-9_4
[arXiv]
[BibTeX]
@incollection{2021_KerdrexDaspremontPokutta_LocalGlobalUniform, year = {2026}, booktitle = {Data Science and Optimization}, series = {Fields Institute Communications}, volume = {91}, publisher = {Springer Science+Business Media}, pages = {85--120}, doi = {10.1007/978-3-032-03844-9_4}, archiveprefix = {arXiv}, eprint = {2102.05134}, arxiv = {arXiv:2102.05134}, primaryclass = {math.OC}, author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian}, title = {Local and Global Uniform Convexity Conditions} } - Braun, G., Halbey, J., Pokutta, S., and Woodstock, Z. (2026). Flexible block-iterative analysis for the Frank-Wolfe algorithm. Journal of Optimization Theory and Applications, 210(2), 37.
DOI: 10.1007/s10957-026-03068-1
[URL]
[arXiv]
[BibTeX]
@article{2024_BraunHalbeyPokuttaWoodstock_Blockiterativeanalysis, year = {2026}, date = {2026-07-31}, journal = {Journal of Optimization Theory and Applications}, volume = {210}, number = {2}, pages = {37}, doi = {10.1007/s10957-026-03068-1}, url = {https://link.springer.com/article/10.1007/s10957-026-03068-1}, archiveprefix = {arXiv}, eprint = {2409.06931}, arxiv = {arXiv:2409.06931}, primaryclass = {math.OC}, author = {Braun, Gábor and Halbey, Jannis and Pokutta, Sebastian and Woodstock, Zev}, title = {Flexible block-iterative analysis for the Frank-Wolfe algorithm} } - Hoen, A., Kamp, D., and Gleixner, A. (2026). MIP-DD: Delta Debugging for Mixed-Integer Programming Solvers. INFORMS Journal on Computing, 38(2), 414–423.
DOI: 10.1287/ijoc.2024.0844
[URL]
[arXiv]
[BibTeX]
@article{2024_HoenKampGleixner_Mipdebugger, year = {2026}, journal = {INFORMS Journal on Computing}, volume = {38}, number = {2}, pages = {414--423}, doi = {10.1287/ijoc.2024.0844}, url = {https://pubsonline.informs.org/doi/10.1287/ijoc.2024.0844}, archiveprefix = {arXiv}, eprint = {2405.19770}, arxiv = {arXiv:2405.19770}, primaryclass = {math.OC}, author = {Hoen, Alexander and Kamp, Dominik and Gleixner, Ambros}, title = {MIP-DD: Delta Debugging for Mixed-Integer Programming Solvers} } - Hendrych, D., Troppens, H., Besançon, M., and Pokutta, S. (2025). Convex mixed-integer optimization with Frank–Wolfe methods. Mathematical Programming Computation, 17(4), 731–757.
DOI: 10.1007/s12532-025-00288-w
[URL]
[arXiv]
[slides]
[code]
[BibTeX]
@article{2022_HendrychTroppensBesanconPokutta_Convexintegerfrankwolfe, year = {2025}, date = {2025-06-28}, journal = {Mathematical Programming Computation}, month = dec, volume = {17}, number = {4}, pages = {731--757}, doi = {10.1007/s12532-025-00288-w}, url = {https://link.springer.com/article/10.1007/s12532-025-00288-w}, archiveprefix = {arXiv}, eprint = {2208.11010}, arxiv = {arXiv:2208.11010}, primaryclass = {math.OC}, author = {Hendrych, Deborah and Troppens, Hannah and Besançon, Mathieu and Pokutta, Sebastian}, title = {Convex mixed-integer optimization with Frank–Wolfe methods}, code = {https://github.com/ZIB-IOL/Boscia.jl}, slides = {https://pokutta.com/slides/20220915_boscia.pdf} } - Besançon, M., Designolle, S., Halbey, J., Hendrych, D., Kuzinowicz, D., Pokutta, S., Troppens, H., Viladrich Herrmannsdoerfer, D., and Wirth, E. (2025). Improved Algorithms and Novel Applications of the FrankWolfe.jl Library. ACM Transactions on Mathematical Software, 51(4), 1–33.
DOI: 10.1145/3765626
[URL]
[arXiv]
[BibTeX]
@article{2025_BesanconEtAl_Frankwolfelibrary, year = {2025}, date = {2025-12-12}, journal = {ACM Transactions on Mathematical Software}, month = dec, volume = {51}, number = {4}, pages = {1--33}, doi = {10.1145/3765626}, url = {https://dl.acm.org/doi/10.1145/3765626}, archiveprefix = {arXiv}, eprint = {2501.14613}, arxiv = {arXiv:2501.14613}, primaryclass = {math.OC}, author = {Besançon, Mathieu and Designolle, Sébastien and Halbey, Jannis and Hendrych, Deborah and Kuzinowicz, Dominik and Pokutta, Sebastian and Troppens, Hannah and Viladrich Herrmannsdoerfer, Daniel and Wirth, Elias}, title = {Improved Algorithms and Novel Applications of the FrankWolfe.jl Library} } - Woodstock, Z., and Pokutta, S. (2025). Splitting the conditional gradient algorithm. SIAM Journal on Optimization, 35(1), 347–368.
DOI: 10.1137/24M1638008
[arXiv]
[BibTeX]
@article{2023_WoodstockPokutta_Conditionalgradientnonconvex, year = {2025}, journal = {SIAM Journal on Optimization}, month = nov, volume = {35}, number = {1}, pages = {347--368}, doi = {10.1137/24M1638008}, archiveprefix = {arXiv}, eprint = {2311.05381}, arxiv = {arXiv:2311.05381}, primaryclass = {math.OC}, author = {Woodstock, Zev and Pokutta, Sebastian}, title = {Splitting the conditional gradient algorithm} } - Bestuzheva, K., Gleixner, A., and Achterberg, T. (2025). Efficient separation of RLT cuts for implicit and explicit bilinear terms. Mathematical Programming, Series B, 210(1-2), 47–74.
DOI: 10.1007/s10107-024-02104-0
[arXiv]
[BibTeX]
@article{2022_BestuzhevaGleixnerAchterberg_Rltcutsbilinear, year = {2025}, journal = {Mathematical Programming, Series B}, volume = {210}, number = {1-2}, pages = {47--74}, doi = {10.1007/s10107-024-02104-0}, archiveprefix = {arXiv}, eprint = {2211.13545}, arxiv = {arXiv: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} } - Bestuzheva, K., Chmiela, A., Müller, B., Serrano, F., Vigerske, S., and Wegscheider, F. (2025). Global optimization of mixed-integer nonlinear programs with SCIP 8. Journal of Global Optimization, 91(2), 287–310.
DOI: 10.1007/s10898-023-01345-1
[URL]
[arXiv]
[BibTeX]
@article{2023_BestuzhevaEtAl_GlobaloptimizationScip80, year = {2025}, journal = {Journal of Global Optimization}, volume = {91}, number = {2}, pages = {287--310}, 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}, arxiv = {arXiv: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} } - Chmiela, A., Muñoz, G., and Serrano, F. (2025). Monoidal strengthening and unique lifting in MIQCPs. Mathematical Programming, Series B, 210(1-2), 189–222.
DOI: 10.1007/s10107-024-02112-0
[URL]
[BibTeX]
@article{2023_ChmielaMuozSerrano_Monoidalstrengthening, year = {2025}, journal = {Mathematical Programming, Series B}, volume = {210}, number = {1-2}, pages = {189--222}, 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} } - Eifler, L., Nicolas-Thouvenin, J., and Gleixner, A. (2025). Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization. INFORMS Journal on Computing, 37(4), 933–944.
DOI: 10.1287/ijoc.2023.0409
[URL]
[arXiv]
[BibTeX]
@article{2023_EiflerNicolasGleixner_Precisionboostinglp, year = {2025}, journal = {INFORMS Journal on Computing}, volume = {37}, number = {4}, pages = {933--944}, doi = {10.1287/ijoc.2023.0409}, note = {ZIB report 23-26}, url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-92573}, archiveprefix = {arXiv}, eprint = {2311.08037}, arxiv = {arXiv: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} } - Halbig, K., Hoen, A., Gleixner, A., Witzig, J., and Weninger, D. (2025). A diving heuristic for mixed-integer problems with unbounded semi-continuous variables. EURO Journal on Computational Optimization, 13, 100107.
DOI: 10.1016/j.ejco.2025.100107
[arXiv]
[BibTeX]
@article{2024_HalbigEtAl_Divingheuristic, year = {2025}, journal = {EURO Journal on Computational Optimization}, volume = {13}, pages = {100107}, doi = {10.1016/j.ejco.2025.100107}, archiveprefix = {arXiv}, eprint = {2403.19411}, arxiv = {arXiv:2403.19411}, primaryclass = {math.OC}, 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} } - 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} } - Carderera, A., Besançon, M., and Pokutta, S. (2024). Scalable Frank-Wolfe on generalized self-concordant functions via simple steps. SIAM Journal on Optimization, 34(3), 2231–2258.
DOI: 10.1137/23M1616789
[URL]
[arXiv]
[summary]
[slides]
[code]
[BibTeX]
@article{2024_CardereraBesanconPokutta_Scalablefrankwolfe, year = {2024}, date = {2024-07-02}, journal = {SIAM Journal on Optimization}, month = sep, volume = {34}, number = {3}, pages = {2231--2258}, doi = {10.1137/23M1616789}, url = {https://epubs.siam.org/doi/full/10.1137/23M1616789?journalCode=sjope8}, archiveprefix = {arXiv}, eprint = {2105.13913}, arxiv = {arXiv:2105.13913}, primaryclass = {math.OC}, author = {Carderera, Alejandro and Besançon, Mathieu and Pokutta, Sebastian}, title = {Scalable Frank-Wolfe on generalized self-concordant functions via simple steps}, code = {https://doi.org/10.5281/zenodo.4836009}, slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf}, summary = {https://pokutta.com/blog/research/2021/10/09/self-concordant-abstract.html} } - Besançon, M., Dias Garcia, J., Legat, B., and Sharma, A. (2024). Flexible Differentiable Optimization via Model Transformations. INFORMS Journal on Computing, 36(2), 456–478.
DOI: 10.1287/ijoc.2022.0283
[URL]
[arXiv]
[BibTeX]
@article{2022_BesanconJoaquimBenotAkshay_Differentiableoptimization, year = {2024}, journal = {INFORMS Journal on Computing}, month = mar, volume = {36}, number = {2}, pages = {456--478}, doi = {10.1287/ijoc.2022.0283}, url = {https://pubsonline.informs.org/doi/epdf/10.1287/ijoc.2022.0283}, archiveprefix = {arXiv}, eprint = {2206.06135}, arxiv = {arXiv:2206.06135}, primaryclass = {cs.LG}, author = {Besançon, Mathieu and Dias Garcia, Joaquim and Legat, Benoît and Sharma, Akshay}, title = {Flexible Differentiable Optimization via Model Transformations} } - 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, 16(2), 255–266.
DOI: 10.1007/s12532-024-00256-w
[arXiv]
[BibTeX]
@article{2023_BolusaniEtAl_Mipreoptimization, year = {2024}, date = {2024-06-06}, journal = {Mathematical Programming Computation}, volume = {16}, number = {2}, pages = {255--266}, doi = {10.1007/s12532-024-00256-w}, archiveprefix = {arXiv}, eprint = {2311.14834}, arxiv = {arXiv: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} } - Eifler, L., and Gleixner, A. (2024). Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework. SIAM Journal on Optimization, 34(1), 742–763.
DOI: 10.1137/23M156046X
[URL]
[arXiv]
[BibTeX]
@article{2023_EiflerGleixner_Gomorycuts, year = {2024}, date = {2024-02-16}, journal = {SIAM Journal on Optimization}, 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}, arxiv = {arXiv:2303.12365}, primaryclass = {math.OC}, author = {Eifler, Leon and Gleixner, Ambros}, title = {Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework} } - 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, 54, 107105.
DOI: 10.1016/j.orl.2024.107105
[URL]
[arXiv]
[BibTeX]
@article{2024_GennesaretBesanconTurnerKoch_Bilevelsudokuclue, year = {2024}, date = {2024-03-07}, journal = {Operations Research Letters}, volume = {54}, pages = {107105}, doi = {10.1016/j.orl.2024.107105}, url = {https://sciencedirect.com/science/article/abs/pii/S0167637724000415}, archiveprefix = {arXiv}, eprint = {2305.01697}, arxiv = {arXiv: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} } - Designolle, S., Iommazzo, G., Besançon, M., Knebel, S., Gelß, P., and Pokutta, S. (2023). Improved local models and new Bell inequalities via Frank-Wolfe algorithms. Physical Review Research, 5(4), 043059.
DOI: 10.1103/PhysRevResearch.5.043059
[arXiv]
[slides]
[code]
[BibTeX]
@article{2023_DesignolleEtAl_LocalmodelsBellinequalities, year = {2023}, journal = {Physical Review Research}, month = oct, volume = {5}, number = {4}, pages = {043059}, doi = {10.1103/PhysRevResearch.5.043059}, archiveprefix = {arXiv}, eprint = {2302.04721}, arxiv = {arXiv:2302.04721}, primaryclass = {quant-ph}, author = {Designolle, Sébastien and Iommazzo, Gabriele and Besançon, Mathieu and Knebel, Sebastian and Gelß, Patrick and Pokutta, Sebastian}, title = {Improved local models and new Bell inequalities via Frank-Wolfe algorithms}, code = {https://github.com/ZIB-IOL/BellPolytopes.jl}, slides = {https://www.pokutta.com/slides/20230808-tokyo-bell.pdf} } - Bestuzheva, K., Gleixner, A., and Vigerske, S. (2023). A computational study of perspective cuts. Mathematical Programming Computation, 15(4), 703–731.
DOI: 10.1007/s12532-023-00246-4
[URL]
[arXiv]
[BibTeX]
@article{2021_BestuzhevaGleixnerVigerske_Perspectivecuts, year = {2023}, date = {2023-08-21}, journal = {Mathematical Programming Computation}, volume = {15}, number = {4}, 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}, arxiv = {arXiv:2103.09573}, primaryclass = {math.OC}, author = {Bestuzheva, Ksenia and Gleixner, Ambros and Vigerske, Stefan}, title = {A computational study of perspective cuts} } - Chmiela, A., Muñoz, G., and Serrano, F. (2023). On the implementation and strengthening of intersection cuts for QCQPs. Mathematical Programming, Series B, 197(2), 549–586.
DOI: 10.1007/s10107-022-01808-5
[URL]
[BibTeX]
@article{2022_ChmielaMuozSerrano_Intersectioncutsqcqps, year = {2023}, journal = {Mathematical Programming, Series B}, volume = {197}, number = {2}, pages = {549--586}, doi = {10.1007/s10107-022-01808-5}, note = {ZIB report 20-29}, url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-79994}, author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe}, title = {On the implementation and strengthening of intersection cuts for QCQPs} } - Gleixner, A., Gottwald, L., and Hoen, A. (2023). PaPILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support. INFORMS Journal on Computing, 35(6), 1329–1341.
DOI: 10.1287/ijoc.2022.0171
[arXiv]
[BibTeX]
@article{2022_GleixnerGottwaldHoen_PapiloMultiprecision, year = {2023}, date = {2023-06-12}, journal = {INFORMS Journal on Computing}, volume = {35}, number = {6}, pages = {1329--1341}, doi = {10.1287/ijoc.2022.0171}, archiveprefix = {arXiv}, eprint = {2206.10709}, arxiv = {arXiv:2206.10709}, primaryclass = {math.OC}, author = {Gleixner, Ambros and Gottwald, Leona and Hoen, Alexander}, title = {PaPILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support} } - 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} } - 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, 49(2), 1–21.
DOI: 10.1145/3585516
[arXiv]
[BibTeX]
@article{2023_BestuzhevaEtAl_ResearchScip, year = {2023}, date = {2023-03-10}, journal = {ACM Transactions on Mathematical Software}, volume = {49}, number = {2}, pages = {1--21}, doi = {10.1145/3585516}, archiveprefix = {arXiv}, eprint = {2303.07101}, arxiv = {arXiv: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} } - Eifler, L., and Gleixner, A. (2023). A computational status update for exact rational mixed integer programming. Mathematical Programming, Series B, 197(2), 793–812.
DOI: 10.1007/s10107-021-01749-5
[URL]
[arXiv]
[BibTeX]
@article{2023_EiflerGleixner_Exactrationalmip, year = {2023}, journal = {Mathematical Programming, Series B}, volume = {197}, number = {2}, pages = {793--812}, doi = {10.1007/s10107-021-01749-5}, note = {ZIB report 21-04}, url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-81298}, archiveprefix = {arXiv}, eprint = {2101.09141}, arxiv = {arXiv:2101.09141}, primaryclass = {math.OC}, author = {Eifler, Leon and Gleixner, Ambros}, title = {A computational status update for exact rational mixed integer programming} } - Sofranac, B., Gleixner, A., and Pokutta, S. (2022). An algorithm-independent measure of progress for linear constraint propagation. Constraints, 27(4), 432–455.
DOI: 10.1007/s10601-022-09338-9
[arXiv]
[BibTeX]
@article{2021_SofranacGleixnerPokutta_Progressmeasure, year = {2022}, date = {2022-10-12}, journal = {Constraints}, month = dec, volume = {27}, number = {4}, pages = {432--455}, doi = {10.1007/s10601-022-09338-9}, archiveprefix = {arXiv}, eprint = {2106.07573}, arxiv = {arXiv: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} } - Wilken, S. E., Besançon, M., Kratochvíl, M., Foko Kuate, C. A., Trefois, C., Gu, W., and Ebenhöh, O. (2022). Interrogating the effect of enzyme kinetics on metabolism using differentiable constraint-based models. Metabolic Engineering, 74, 72–82.
DOI: 10.1016/j.ymben.2022.09.002
[BibTeX]
@article{2022_ElmoEtAl_Enzymekineticsmetabolism, year = {2022}, journal = {Metabolic Engineering}, month = nov, volume = {74}, pages = {72--82}, doi = {10.1016/j.ymben.2022.09.002}, author = {Wilken, St. Elmo and Besançon, Mathieu and Kratochvíl, Miroslav and Foko Kuate, Chilperic Armel and Trefois, Christophe and Gu, Wei and Ebenhöh, Oliver}, title = {Interrogating the effect of enzyme kinetics on metabolism using differentiable constraint-based models} } - Besançon, M., Carderera, A., and Pokutta, S. (2022). FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients. INFORMS Journal on Computing, 34(5), 2611–2620.
DOI: 10.1287/ijoc.2022.1191
[URL]
[arXiv]
[summary]
[slides]
[code]
[BibTeX]
@article{2021_BesanconCardereraPokutta_Frankwolfetoolbox, year = {2022}, journal = {INFORMS Journal on Computing}, month = sep, volume = {34}, number = {5}, pages = {2611--2620}, doi = {10.1287/ijoc.2022.1191}, url = {https://pubsonline.informs.org/doi/abs/10.1287/ijoc.2022.1191}, archiveprefix = {arXiv}, eprint = {2104.06675}, arxiv = {arXiv:2104.06675}, primaryclass = {math.OC}, author = {Besançon, Mathieu and Carderera, Alejandro and Pokutta, Sebastian}, title = {FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients}, code = {https://github.com/ZIB-IOL/FrankWolfe.jl}, slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf}, summary = {https://pokutta.com/blog/research/2021/04/20/FrankWolfejl.html} } - Sofranac, B., Gleixner, A., and Pokutta, S. (2022). Accelerating domain propagation: An efficient GPU-parallel algorithm over sparse matrices. Parallel Computing, 109, 102874.
DOI: 10.1016/j.parco.2021.102874
[URL]
[arXiv]
[summary]
[BibTeX]
@article{2020_SofranacGleixnerPokutta_Domainpropagation, year = {2022}, journal = {Parallel Computing}, month = mar, volume = {109}, pages = {102874}, doi = {10.1016/j.parco.2021.102874}, url = {https://www.sciencedirect.com/science/article/pii/S0167819121001149}, archiveprefix = {arXiv}, eprint = {2009.07785}, arxiv = {arXiv: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} } - 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
[URL]
[arXiv]
[BibTeX]
@article{2022_EiflerGleixnerPulaj_Safeintegerprogramming, year = {2022}, date = {2022-05-26}, journal = {ACM Transactions on Mathematical Software}, volume = {48}, number = {2}, pages = {1--12}, doi = {10.1145/3485630}, note = {ZIB report 21-35}, url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-84444}, archiveprefix = {arXiv}, eprint = {1809.01572}, arxiv = {arXiv: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} } - Müller, B., Muñoz, G., Gasse, M., Gleixner, A., Lodi, A., and Serrano, F. (2022). On generalized surrogate duality in mixed-integer nonlinear programming. Mathematical Programming, Series B, 192(1-2), 89–118.
DOI: 10.1007/s10107-021-01691-6
[arXiv]
[BibTeX]
@article{2022_MllerEtAl_Generalizedsurrogateduality, year = {2022}, journal = {Mathematical Programming, Series B}, volume = {192}, number = {1-2}, pages = {89--118}, doi = {10.1007/s10107-021-01691-6}, archiveprefix = {arXiv}, eprint = {1912.00356}, arxiv = {arXiv:1912.00356}, primaryclass = {math.OC}, author = {Müller, Benjamin and Muñoz, Gonzalo and Gasse, Maxime and Gleixner, Ambros and Lodi, Andrea and Serrano, Felipe}, title = {On generalized surrogate duality in mixed-integer nonlinear programming} } - Rehfeldt, D., Hobbie, H., Schönheit, D., Koch, T., Möst, D., and Gleixner, A. (2022). A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models. European Journal of Operational Research, 296(1), 60–71.
DOI: 10.1016/j.ejor.2021.06.063
[BibTeX]
@article{2022_RehfeldtEtAl_Parallelinteriorpoint, year = {2022}, journal = {European Journal of Operational Research}, volume = {296}, number = {1}, pages = {60--71}, doi = {10.1016/j.ejor.2021.06.063}, author = {Rehfeldt, Daniel and Hobbie, Hannes and Schönheit, David and Koch, Thorsten and Möst, Dominik and Gleixner, Ambros}, title = {A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models} } - Combettes, C., and Pokutta, S. (2021). Complexity of linear minimization and projection on some sets. Operations Research Letters, 49(4), 565–571.
DOI: 10.1016/j.orl.2021.06.005
[arXiv]
[code]
[BibTeX]
@article{2021_CombettesPokutta_ComplexityLinearMinimization, year = {2021}, journal = {Operations Research Letters}, month = jul, volume = {49}, number = {4}, pages = {565--571}, doi = {10.1016/j.orl.2021.06.005}, archiveprefix = {arXiv}, eprint = {2101.10040}, arxiv = {arXiv:2101.10040}, primaryclass = {math.OC}, author = {Combettes, Cyrille and Pokutta, Sebastian}, title = {Complexity of linear minimization and projection on some sets}, code = {https://github.com/cyrillewcombettes/complexity} } - Prause, F., Hoppmann-Baum, K., Defourny, B., and Koch, T. (2021). The maximum diversity assortment selection problem. Mathematical Methods of Operations Research, 93(3), 521–554.
DOI: 10.1007/s00186-021-00740-2
[BibTeX]
@article{2021_PrauseHoppmannDefournyKoch_Maximumdiversityassortment, year = {2021}, journal = {Mathematical Methods of Operations Research}, volume = {93}, number = {3}, pages = {521--554}, doi = {10.1007/s00186-021-00740-2}, author = {Prause, Felix and Hoppmann-Baum, Kai and Defourny, Boris and Koch, Thorsten}, title = {The maximum diversity assortment selection problem} } - 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. The Science of The Total Environment, 751, 141706.
DOI: 10.1016/j.scitotenv.2020.141706
[BibTeX]
@article{2021_RaminEtAl_Incrementalwatersymbiosis, year = {2021}, date = {2021-01-10}, journal = {The Science of The Total Environment}, volume = {751}, pages = {141706}, 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} }






















