Continuous Optimization

Publications and preprints

Preprints and reports

1. 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}
   }

2. 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}
   }

3. 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}
   }

4. Pokutta, S., Schmaltz, C., and Stiller, S. (2011). Measuring Systemic Risk and Contagion in Financial Networks. DOI: 10.2139/ssrn.1773089 [URL]
   [BibTeX]

   @misc{2011_PokuttaSchmaltzStiller_MeasuringSystemicRisk,
     year = {2011},
     doi = {10.2139/ssrn.1773089},
     url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=1773089},
     author = {Pokutta, Sebastian and Schmaltz, C. and Stiller, S.},
     title = {Measuring Systemic Risk and Contagion in Financial Networks}
   }

5. Pokutta, S. (2011). Lower bounds for Chvátal-Gomory style operators. [URL]
   [BibTeX]

   @misc{2011_Pokutta_LowerBoundsChvatalGomory,
     year = {2011},
     url = {https://optimization-online.org/?p=2011/09/3151},
     author = {Pokutta, Sebastian},
     title = {Lower bounds for Chvátal-Gomory style operators}
   }

6. Pokutta, S., and Schulz, A. S. (2009). On the connection of the Sherali-Adams closure and border bases. [URL]
   [BibTeX]

   @misc{2009_PokuttaSchulz_SheraliAdamsBorderBases,
     year = {2009},
     url = {https://optimization-online.org/?p=2009/08/2378},
     author = {Pokutta, Sebastian and Schulz, A.S.},
     title = {On the connection of the Sherali-Adams closure and border bases}
   }

7. Braun, G., and Pokutta, S. (2009). A polyhedral approach to computing border bases. [arXiv]
   [BibTeX]

   @misc{2010_BraunPokutta_PolyhedralApproach,
     archiveprefix = {arXiv},
     eprint = {0911.0859},
     arxiv = {arXiv:0911.0859},
     primaryclass = {math.AC},
     author = {Braun, Gábor and Pokutta, Sebastian},
     title = {A polyhedral approach to computing border bases},
     date = {2009-11-04}
   }

8. Braun, G., and Pokutta, S. (2016). An efficient high-probability algorithm for Linear Bandits. [arXiv]
   [BibTeX]

   @misc{2016_BraunPokutta_Highprobabilitylinearbandits,
     archiveprefix = {arXiv},
     eprint = {1610.02072},
     arxiv = {arXiv:1610.02072},
     primaryclass = {cs.DS},
     author = {Braun, Gábor and Pokutta, Sebastian},
     title = {An efficient high-probability algorithm for Linear Bandits},
     date = {2016-10-06}
   }

9. Pokutta, S., Singh, M., and Torrico, A. (2018). Efficient algorithms for robust submodular maximization under matroid constraints. [arXiv]
   [BibTeX]

   @misc{2018_PokuttaSinghTorrico_EfficientAlgorithms,
     archiveprefix = {arXiv},
     eprint = {1807.09405},
     arxiv = {arXiv:1807.09405},
     primaryclass = {cs.DS},
     author = {Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
     title = {Efficient algorithms for robust submodular maximization under matroid constraints},
     date = {2018-07-25}
   }

10. 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}
    }

11. 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}
    }

12. Roux, C., Wirth, E., Pokutta, S., and Kerdreux, T. (2021). Efficient Online-Bandit Strategies for Minimax Learning Problems. [arXiv]
    [BibTeX]

    @misc{2021_RouxWirthPokuttaKerdreux_Onlinebanditminimax,
      archiveprefix = {arXiv},
      eprint = {2105.13939},
      arxiv = {arXiv:2105.13939},
      primaryclass = {cs.LG},
      author = {Roux, Christophe and Wirth, Elias and Pokutta, Sebastian and Kerdreux, Thomas},
      title = {Efficient Online-Bandit Strategies for Minimax Learning Problems},
      date = {2021-05-28}
    }

13. Braun, G., Pokutta, S., and Weismantel, R. (2022). Alternating Linear Minimization: Revisiting von Neumann’s alternating projections. [arXiv] [slides] [video]
    [BibTeX]

    @misc{2022_BraunPokuttaWeismantel_Alternatingminimization,
      archiveprefix = {arXiv},
      eprint = {2212.02933},
      arxiv = {arXiv:2212.02933},
      primaryclass = {math.OC},
      author = {Braun, Gábor and Pokutta, Sebastian and Weismantel, Robert},
      title = {Alternating Linear Minimization: Revisiting von Neumann's alternating projections},
      slides = {https://pokutta.com/slides/20230327-icerm.pdf},
      video = {https://icerm.brown.edu/programs/sp-s23/w2/#schedule-item-4945},
      date = {2022-12-06}
    }

14. Bestuzheva, K., Völker, H., and Gleixner, A. (2023). Strengthening SONC Relaxations with Constraints Derived from Variable Bounds. [arXiv]
    [BibTeX]

    @misc{2023_BestuzhevaGleixnerVlker_Soncconstraints,
      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},
      date = {2023-04-24}
    }

15. 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}
    }

16. Scieur, D., Martínez-Rubio, D., Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2023). Strong Convexity of Sets in Riemannian Manifolds. [arXiv]
    [BibTeX]

    @misc{2023_KerdreuxScieurDaspremontPokutta_StrongconvexityRiemannianmanifolds,
      archiveprefix = {arXiv},
      eprint = {2312.03583},
      arxiv = {arXiv:2312.03583},
      primaryclass = {math.OC},
      author = {Scieur, Damien and Martínez-Rubio, David and Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Strong Convexity of Sets in Riemannian Manifolds},
      date = {2023-12-06}
    }

17. 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}
    }

18. 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}
    }

19. 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}
    }

20. 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}
    }

21. 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}
    }

22. Dangel, F., Siebert, T., Zeinhofer, M., and Walther, A. (2025). Collapsing Taylor Mode Automatic Differentiation. [arXiv]
    [BibTeX]

    @misc{2025_DangelSiebertZeinhoferWalther_Collapsingtaylormode_2505-13644,
      archiveprefix = {arXiv},
      eprint = {2505.13644},
      arxiv = {arXiv:2505.13644},
      primaryclass = {cs.LG},
      author = {Dangel, Felix and Siebert, Tim and Zeinhofer, Marius and Walther, Andrea},
      title = {Collapsing Taylor Mode Automatic Differentiation},
      date = {2025-05-19}
    }

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}
    }

24. 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}
    }

25. 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}
    }

26. 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}
    }

27. 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}
    }

28. Takahashi, S., Pokutta, S., and Takeda, A. (2025). Fast Frank–Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions. [arXiv]
    [BibTeX]

    @misc{2025_ShotaPokuttaAkiko_Frankwolfebregman,
      archiveprefix = {arXiv},
      eprint = {2504.04330},
      arxiv = {arXiv:2504.04330},
      primaryclass = {math.OC},
      author = {Takahashi, Shota and Pokutta, Sebastian and Takeda, Akiko},
      title = {Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions},
      date = {2025-04-06}
    }

29. 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}
    }

30. 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}
    }

31. Zimmer, M., Roux, C., Wagner, M., Hendrych, D., and Pokutta, S. (2025). SparseSwaps: Tractable LLM Pruning Mask Refinement at Scale. [arXiv]
    [BibTeX]

    @misc{2025_ZimmerEtAl_Sparseswapspruning_2512-10922,
      archiveprefix = {arXiv},
      eprint = {2512.10922},
      arxiv = {arXiv:2512.10922},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Roux, Christophe and Wagner, Moritz and Hendrych, Deborah and Pokutta, Sebastian},
      title = {SparseSwaps: Tractable LLM Pruning Mask Refinement at Scale},
      date = {2025-12-11}
    }

32. 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}
    }

33. Elhishi, A., Roux, C., and d’Aspremont, A. (2026). Restart and Adaptive Acceleration in Stochastic Gradient Methods. [arXiv]
    [BibTeX]

    @misc{2026_ElhishiRouxD'aspremont_Restartacceleration_2606-21354,
      archiveprefix = {arXiv},
      eprint = {2606.21354},
      arxiv = {arXiv:2606.21354},
      primaryclass = {math.OC},
      author = {Elhishi, Ali and Roux, Christophe and d'Aspremont, Alexandre},
      title = {Restart and Adaptive Acceleration in Stochastic Gradient Methods},
      date = {2026-06-19}
    }

34. Zambrini Cruzeiro, E., Gonzales-Ureta, J. R., Choudhary, R., Abreu, H., Cabello, A., and Designolle, S. (2026). Exploring Bell Nonlocality with Extremal Non-Signaling Boxes. [arXiv]
    [BibTeX]

    @misc{2026_EmmanuelEtAl_EnsboxesBellnonlocality_2601-08924,
      archiveprefix = {arXiv},
      eprint = {2601.08924},
      arxiv = {arXiv:2601.08924},
      primaryclass = {quant-ph},
      author = {Zambrini Cruzeiro, Emmanuel and Gonzales-Ureta, Junior R. and Choudhary, Raman and Abreu, Hugo and Cabello, Adán and Designolle, Sébastien},
      title = {Exploring Bell Nonlocality with Extremal Non-Signaling Boxes},
      date = {2026-01-13}
    }

35. 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}
    }

36. 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}
    }

37. 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}
    }

38. 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}
    }

39. Pokutta, S., and Stellato, B. (2026). The exact worst-case asymptotic rate of Nesterov acceleration for strongly convex optimization. [arXiv]
    [BibTeX]

    @misc{2026_PokuttaStellato_NesterovWorstCaseRate_2610-15125,
      archiveprefix = {arXiv},
      eprint = {2610.15125},
      arxiv = {arXiv:2610.15125},
      primaryclass = {math.OC},
      author = {Pokutta, Sebastian and Stellato, Bartolomeo},
      title = {The exact worst-case asymptotic rate of Nesterov acceleration for strongly convex optimization},
      date = {2026-10-10}
    }

40. Pokutta, S. (2026). Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets. [arXiv]
    [BibTeX]

    @misc{2026_Pokutta_RandomizedLinearOracle_2610-13590,
      archiveprefix = {arXiv},
      eprint = {2610.13590},
      arxiv = {arXiv:2610.13590},
      primaryclass = {math.OC},
      author = {Pokutta, Sebastian},
      title = {Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets},
      date = {2026-10-09}
    }

41. Schiekiera, L., Zimmer, M., Roux, C., Arnold, M., Pokutta, S., and Günther, F. (2026). LinearPFN: Amortized Variable Selection for Linear Models with Interactions. [arXiv]
    [BibTeX]

    @misc{2026_SchiekieraEtAl_LinearPFNVariableSelection_2610-06580,
      archiveprefix = {arXiv},
      eprint = {2610.06580},
      arxiv = {arXiv:2610.06580},
      primaryclass = {cs.LG},
      author = {Schiekiera, Louis and Zimmer, Max and Roux, Christophe and Arnold, Manuel and Pokutta, Sebastian and Günther, Fritz},
      title = {LinearPFN: Amortized Variable Selection for Linear Models with Interactions},
      date = {2026-10-05}
    }

42. Wagner, M., Roux, C., Zimmer, M., and Pokutta, S. (2026). The KV-Surgeon: Compensation-Aware Offline KV-Cache Compaction. [arXiv]
    [BibTeX]

    @misc{2026_WagnerRouxZimmerPokutta_KVCacheCompaction_2610-25933,
      archiveprefix = {arXiv},
      eprint = {2610.25933},
      arxiv = {arXiv:2610.25933},
      primaryclass = {cs.LG},
      author = {Wagner, Moritz and Roux, Christophe and Zimmer, Max and Pokutta, Sebastian},
      title = {The KV-Surgeon: Compensation-Aware Offline KV-Cache Compaction},
      date = {2026-10-19}
    }

43. Xu, L., Zhou, Y., and Pokutta, S. (2026). Agentic MIP Research: Accelerated Constraint Handler Generation. [arXiv]
    [BibTeX]

    @misc{2026_XuZhouPokutta_Agenticmip_2605-09186,
      archiveprefix = {arXiv},
      eprint = {2605.09186},
      arxiv = {arXiv:2605.09186},
      primaryclass = {cs.AI},
      author = {Xu, Liding and Zhou, Yugeng and Pokutta, Sebastian},
      title = {Agentic MIP Research: Accelerated Constraint Handler Generation},
      date = {2026-05-09}
    }

44. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Xie, Y., Pelleriti, N., Liu, S., Lu, M., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). AlphaDiana: A Measurement System for Agents in Verifiable Reasoning Tasks. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675,
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Lu, Menghan and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {AlphaDiana: A Measurement System for Agents in Verifiable Reasoning Tasks},
      date = {2026-10-14}
    }

45. Zimmer, M., Pelleriti, N., Roux, C., and Pokutta, S. (2026). The Agentic Researcher: A Practical Guide to AI-Assisted Research in Mathematics and Machine Learning. [arXiv]
    [BibTeX]

    @misc{2026_ZimmerPelleritiRouxPokutta_Airesearchframework_2603-15914,
      archiveprefix = {arXiv},
      eprint = {2603.15914},
      arxiv = {arXiv:2603.15914},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Pelleriti, Nico and Roux, Christophe and Pokutta, Sebastian},
      title = {The Agentic Researcher: A Practical Guide to AI-Assisted Research in Mathematics and Machine Learning},
      date = {2026-03-16}
    }

Conference contributions

1. Halbey, J., Roux, C., and Pokutta, S. Curvature-Dependent Lower Bounds for Frank-Wolfe. Advances in Neural Information Processing Systems, 39. To appear. Associated with NeurIPS 2026. [arXiv]
   [BibTeX]

   @inproceedings{2026_HalbeyRouxPokutta_Curvaturelowerbounds_2605-10595,
     booktitle = {Advances in Neural Information Processing Systems},
     series = {Advances in Neural Information Processing Systems},
     volume = {39},
     publisher = {Curran Associates},
     note = {To appear},
     archiveprefix = {arXiv},
     eprint = {2605.10595},
     arxiv = {arXiv:2605.10595},
     primaryclass = {math.OC},
     author = {Halbey, Jannis and Roux, Christophe and Pokutta, Sebastian},
     title = {Curvature-Dependent Lower Bounds for Frank-Wolfe}
   }

2. Koshizuka, T., Blessing, D., Zimmer, M., Pokutta, S., and Richter, L. A Trust Region Approach for Learning Schrödinger Bridges. Advances in Neural Information Processing Systems, 39. To appear. Associated with NeurIPS 2026.
   [BibTeX]

   @inproceedings{2026_KoshizukaEtAl_TrustregionSchrodingerbridges,
     booktitle = {Advances in Neural Information Processing Systems},
     series = {Advances in Neural Information Processing Systems},
     volume = {39},
     publisher = {Curran Associates},
     note = {To appear},
     author = {Koshizuka, Takeshi and Blessing, Denis and Zimmer, Max and Pokutta, Sebastian and Richter, Lorenz},
     title = {A Trust Region Approach for Learning Schrödinger Bridges}
   }

3. Pokutta, S. Frank-Wolfe Beyond 1/t Convergence. Advances in Neural Information Processing Systems, 39. To appear. Associated with NeurIPS 2026. [arXiv]
   [BibTeX]

   @inproceedings{2026_Pokutta_Localdualsharpness_2604-28006,
     booktitle = {Advances in Neural Information Processing Systems},
     series = {Advances in Neural Information Processing Systems},
     volume = {39},
     publisher = {Curran Associates},
     note = {To appear},
     archiveprefix = {arXiv},
     eprint = {2604.28006},
     arxiv = {arXiv:2604.28006},
     primaryclass = {math.OC},
     author = {Pokutta, Sebastian},
     title = {Frank-Wolfe Beyond 1/t Convergence}
   }

4. 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}
   }

5. 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}
   }

6. Halbey, J., Deza, D., Zimmer, M., Roux, C., Stellato, B., and Pokutta, S. (2026). Lower Bounds for Frank-Wolfe on Strongly Convex Sets. Proceedings of the 43rd International Conference on Machine Learning, 306. Associated with ICML 2026. [arXiv]
   [BibTeX]

   @inproceedings{2026_HalbeyEtAl_Lowerboundsfrankwolfe_2602-04378,
     year = {2026},
     booktitle = {Proceedings of the 43rd International Conference on Machine Learning},
     series = {Proceedings of Machine Learning Research},
     volume = {306},
     month = jul,
     archiveprefix = {arXiv},
     eprint = {2602.04378},
     arxiv = {arXiv:2602.04378},
     primaryclass = {math.OC},
     author = {Halbey, Jannis and Deza, Daniel and Zimmer, Max and Roux, Christophe and Stellato, Bartolomeo and Pokutta, Sebastian},
     title = {Lower Bounds for Frank-Wolfe on Strongly Convex Sets}
   }

7. Schiekiera, L., Zimmer, M., Roux, C., Pokutta, S., and Günther, F. (2026). From Associations to Activations: Comparing Behavioral and Hidden-State Semantic Geometry in LLMs. Proceedings of the 43rd International Conference on Machine Learning, 306. Associated with ICML 2026. [arXiv]
   [BibTeX]

   @inproceedings{2026_LouisEtAl_Behavioralgeometry_2602-00628,
     year = {2026},
     booktitle = {Proceedings of the 43rd International Conference on Machine Learning},
     series = {Proceedings of Machine Learning Research},
     volume = {306},
     month = jul,
     archiveprefix = {arXiv},
     eprint = {2602.00628},
     arxiv = {arXiv:2602.00628},
     primaryclass = {cs.LG},
     author = {Schiekiera, Louis and Zimmer, Max and Roux, Christophe and Pokutta, Sebastian and Günther, Fritz},
     title = {From Associations to Activations: Comparing Behavioral and Hidden-State Semantic Geometry in LLMs}
   }

8. Tadinada, S., Siebert, T., Fuhrmann, J., Pokutta, S., and Walther, A. (2026). An AD-enabled Frank-Wolfe Method for Non-smooth Optimization. Proceedings of the 2024 International Conference on Algorithmic Differentiation (AD), 90–106. Associated with AD 2024. DOI: 10.1137/1.9781611979039.7 [URL]
   [BibTeX]

   @inproceedings{2024_TadinadaEtAl_ADenabledFrankWolfe,
     year = {2026},
     booktitle = {Proceedings of the 2024 International Conference on Algorithmic Differentiation (AD)},
     publisher = {Society for Industrial and Applied Mathematics},
     pages = {90--106},
     doi = {10.1137/1.9781611979039.7},
     url = {https://epubs.siam.org/doi/10.1137/1.9781611979039.7},
     author = {Tadinada, Sri and Siebert, Tim and Fuhrmann, Jürgen and Pokutta, Sebastian and Walther, Andrea},
     title = {An AD-enabled Frank-Wolfe Method for Non-smooth Optimization}
   }

9. 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}
   }

10. 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}
    }

11. Pelleriti, N., Kraus, N., May, A., and Pokutta, S. (2026). CryptHarness: A Harness for Agent-Assisted Cryptanalytic Research. Accepted at NeurIPS 2026 Workshop on SaTQuML: Secure and Trustworthy Quantum Machine Learning.
    [BibTeX]

    @misc{2026_PelleritiKrausMayPokutta_CryptHarness,
      howpublished = {Accepted at NeurIPS 2026 Workshop on SaTQuML: Secure and Trustworthy Quantum Machine Learning},
      year = {2026},
      author = {Pelleriti, Nico and Kraus, Nicolai and May, Alexander and Pokutta, Sebastian},
      title = {CryptHarness: A Harness for Agent-Assisted Cryptanalytic Research}
    }

12. Pelleriti, N., Kraus, N., May, A., and Pokutta, S. (2026). CryptHarness: A Harness for Agent-Assisted Cryptanalytic Research. Accepted at Third Workshop on Agents in the Wild: Safety, Security, and Beyond @ NeurIPS 2026.
    [BibTeX]

    @misc{2026_PelleritiKrausMayPokutta_CryptHarness:1,
      howpublished = {Accepted at Third Workshop on Agents in the Wild: Safety, Security, and Beyond @ NeurIPS 2026},
      year = {2026},
      author = {Pelleriti, Nico and Kraus, Nicolai and May, Alexander and Pokutta, Sebastian},
      title = {CryptHarness: A Harness for Agent-Assisted Cryptanalytic Research}
    }

13. Pelleriti, N., Mundinger, K., Zimmer, M., and Pokutta, S. (2026). Zero: A Meta-Agent for Mathematical Research. Accepted at The Sixth Workshop on Mathematical Reasoning and AI @ NeurIPS 2026.
    [BibTeX]

    @misc{2026_PelleritiMundingerZimmerPokutta_Zero,
      howpublished = {Accepted at The Sixth Workshop on Mathematical Reasoning and AI @ NeurIPS 2026},
      year = {2026},
      author = {Pelleriti, Nico and Mundinger, Konrad and Zimmer, Max and Pokutta, Sebastian},
      title = {Zero: A Meta-Agent for Mathematical Research}
    }

14. Pelleriti, N., Mundinger, K., Zimmer, M., and Pokutta, S. (2026). Zero: A Meta-Agent for Mathematical Research. Accepted at First Workshop on Meta Agents: Managing Agents That Manage Agents @ NeurIPS 2026.
    [BibTeX]

    @misc{2026_PelleritiMundingerZimmerPokutta_Zero:1,
      howpublished = {Accepted at First Workshop on Meta Agents: Managing Agents That Manage Agents @ NeurIPS 2026},
      year = {2026},
      author = {Pelleriti, Nico and Mundinger, Konrad and Zimmer, Max and Pokutta, Sebastian},
      title = {Zero: A Meta-Agent for Mathematical Research}
    }

15. Petit-Tichanné, U., Pelleriti, N., Zimmer, M., and Pokutta, S. (2026). Learning the Coefficients of the Standard Volatility Forecaster. Accepted at NeurIPS 2026 Workshop TS-LIMITS: Generalization for Time Series in Tight Settings: Latency, Inference, Memory, PrIvacy and SusTainability.
    [BibTeX]

    @misc{2026_PetitTichannePelleritiZimmerPokutta_Volatilityforecaster,
      howpublished = {Accepted at NeurIPS 2026 Workshop TS-LIMITS: Generalization for Time Series in Tight Settings: Latency, Inference, Memory, PrIvacy and SusTainability},
      year = {2026},
      author = {Petit-Tichanné, Ulysse and Pelleriti, Nico and Zimmer, Max and Pokutta, Sebastian},
      title = {Learning the Coefficients of the Standard Volatility Forecaster}
    }

16. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Lu, M., Xie, Y., Pelleriti, N., Liu, S., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). Reasoning Is More Than the Model: Harness-Aware Evaluation of Agents on Verifiable Reasoning Tasks. Accepted at ICML 2026 Workshop on AI As a Tool for Mathematics, Computer Science, and Machine Learning. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675:1,
      howpublished = {Accepted at ICML 2026 Workshop on AI As a Tool for Mathematics, Computer Science, and Machine Learning},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Lu, Menghan and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {Reasoning Is More Than the Model: Harness-Aware Evaluation of Agents on Verifiable Reasoning Tasks}
    }

17. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Lu, M., Xie, Y., Pelleriti, N., Liu, S., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). Reasoning Is More Than the Model: Harness-Aware Evaluation of Agents on Verifiable Reasoning Tasks. Accepted at 3rd AI for Math Workshop: Toward Self-Evolving Scientific Agents @ ICML 2026. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675:2,
      howpublished = {Accepted at 3rd AI for Math Workshop: Toward Self-Evolving Scientific Agents @ ICML 2026},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Lu, Menghan and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {Reasoning Is More Than the Model: Harness-Aware Evaluation of Agents on Verifiable Reasoning Tasks}
    }

18. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Lu, M., Xie, Y., Pelleriti, N., Liu, S., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). AlphaDiana: A System for Evaluating Reasoning Agents. Accepted at NeurIPS 2026 Workshop on Towards Test-Time Continual Learning Agents. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675:3,
      howpublished = {Accepted at NeurIPS 2026 Workshop on Towards Test-Time Continual Learning Agents},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Lu, Menghan and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {AlphaDiana: A System for Evaluating Reasoning Agents}
    }

19. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Lu, M., Xie, Y., Pelleriti, N., Liu, S., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). AlphaDiana: A System for Evaluating Reasoning Agents. Accepted at The Sixth Workshop on Mathematical Reasoning and AI @ NeurIPS 2026. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675:4,
      howpublished = {Accepted at The Sixth Workshop on Mathematical Reasoning and AI @ NeurIPS 2026},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Lu, Menghan and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {AlphaDiana: A System for Evaluating Reasoning Agents}
    }

20. Halbey, J., Rakotomandimby, S., Besançon, M., Designolle, S., and Pokutta, S. (2025). Efficient Quadratic Corrections for Frank-Wolfe Algorithms. Advances in Neural Information Processing Systems, 38. Associated with NeurIPS 2025. [arXiv]
    [BibTeX]

    @inproceedings{2025_HalbeyRakotomandimbyBesanconDesignollePokutta_Quadraticcorrections_2506-02635,
      year = {2025},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {38},
      publisher = {Curran Associates},
      month = sep,
      archiveprefix = {arXiv},
      eprint = {2506.02635},
      arxiv = {arXiv:2506.02635},
      primaryclass = {math.OC},
      author = {Halbey, Jannis and Rakotomandimby, Seta and Besançon, Mathieu and Designolle, Sébastien and Pokutta, Sebastian},
      title = {Efficient Quadratic Corrections for Frank-Wolfe Algorithms}
    }

21. 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}
    }

22. Pelleriti, N., Zimmer, M., Wirth, E., and Pokutta, S. (2025). Approximating Latent Manifolds in Neural Networks via Vanishing Ideals. Proceedings of the 42nd International Conference on Machine Learning, 267. Associated with ICML 2025. [arXiv]
    [BibTeX]

    @inproceedings{2025_PelleritiZimmerWirthPokutta_Latentmanifolds,
      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 = {2502.15051},
      arxiv = {arXiv:2502.15051},
      primaryclass = {cs.LG},
      author = {Pelleriti, Nico and Zimmer, Max and Wirth, Elias and Pokutta, Sebastian},
      title = {Approximating Latent Manifolds in Neural Networks via Vanishing Ideals}
    }

23. 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}
    }

24. 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}
    }

25. 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}
    }

26. 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}
    }

27. Wirth, E., Besançon, M., and Pokutta, S. (2025). The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control. Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, 258, 271–279. Associated with AISTATS 2025. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2024_WirthBesanconPokutta_Pivotingframework,
      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 = {271--279},
      url = {https://proceedings.mlr.press/v258/besancon25a.html},
      archiveprefix = {arXiv},
      eprint = {2407.11760},
      arxiv = {arXiv:2407.11760},
      primaryclass = {math.OC},
      author = {Wirth, Elias and Besançon, Mathieu and Pokutta, Sebastian},
      title = {The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control}
    }

28. 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}
    }

29. 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}
    }

30. 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}
    }

31. 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}
    }

32. 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}
    }

33. 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}
    }

34. Fackeldey, K., Kannan, A., Pokutta, S., Sharma, K., Walter, D., Walther, A., and Weiser, M. (2025). Mathematical Optimization for Machine Learning. Mathematical Optimization for Machine Learning. DOI: 10.1515/9783111376776 [URL]
    [BibTeX]

    @inproceedings{2025_FackeldeyEtAl_MathematicalOptimization,
      year = {2025},
      booktitle = {Mathematical Optimization for Machine Learning},
      series = {De Gruyter Proceedings in Mathematics},
      publisher = {Walter de Gruyter},
      doi = {10.1515/9783111376776},
      url = {https://www.degruyterbrill.com/document/doi/10.1515/9783111376776/html},
      author = {Fackeldey, Konstantin and Kannan, Aswin and Pokutta, Sebastian and Sharma, Kartikey and Walter, Daniel and Walther, Andrea and Weiser, Martin},
      title = {Mathematical Optimization for Machine Learning}
    }

35. 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}
    }

36. 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}
    }

37. 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}
    }

38. 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}
    }

39. 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}
    }

40. 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}
    }

41. 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}
    }

42. 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}
    }

43. Martínez-Rubio, D., and Pokutta, S. (2023). Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties. Proceedings of Thirty Sixth Conference on Learning Theory, 195. Associated with COLT 2023. [URL] [arXiv] [poster]
    [BibTeX]

    @inproceedings{2022_MartinezrubioPokutta_Acceleratedriemannian,
      year = {2023},
      booktitle = {Proceedings of Thirty Sixth Conference on Learning Theory},
      series = {Proceedings of Machine Learning Research},
      volume = {195},
      month = may,
      url = {https://proceedings.mlr.press/v195/martinez-rubio23a/martinez-rubio23a.pdf},
      archiveprefix = {arXiv},
      eprint = {2211.14645},
      arxiv = {arXiv:2211.14645},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties},
      poster = {https://pokutta.com/slides/20221203_poster_neurips_riemannian.pdf}
    }

44. 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}
    }

45. 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}
    }

46. Martínez-Rubio, D., Wirth, E., and Pokutta, S. (2023). Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond. Proceedings of Thirty Sixth Conference on Learning Theory, 195. Associated with COLT 2023. [arXiv]
    [BibTeX]

    @inproceedings{2023_MartinezrubioWirthPokutta_Sparseapproximatepagerank,
      year = {2023},
      booktitle = {Proceedings of Thirty Sixth Conference on Learning Theory},
      series = {Proceedings of Machine Learning Research},
      volume = {195},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2303.12875},
      arxiv = {arXiv:2303.12875},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Wirth, Elias and Pokutta, Sebastian},
      title = {Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond}
    }

47. Wirth, E., Kera, H., and Pokutta, S. (2023, January). Approximate Vanishing Ideal Computations at Scale. 11th International Conference on Learning Representations (ICLR 2023). Associated with ICLR 2023. [arXiv] [slides]
    [BibTeX]

    @inproceedings{2022_WirthKeraPokutta_Approximatevanishingideal,
      year = {2023},
      booktitle = {11th International Conference on Learning Representations (ICLR 2023)},
      publisher = {ICLR (OpenReview)},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2207.01236},
      arxiv = {arXiv:2207.01236},
      primaryclass = {cs.LG},
      author = {Wirth, Elias and Kera, Hiroshi and Pokutta, Sebastian},
      title = {Approximate Vanishing Ideal Computations at Scale},
      slides = {https://pokutta.com/slides/20220915_avi_at_scale.pdf}
    }

48. Wirth, E., Kerdreux, T., and Pokutta, S. (2023). Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes. Proceedings of The 26th International Conference on Artificial Intelligence and Statistics, 206, 77–100. Associated with AISTATS 2023. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2022_WirthKerdreuxPokutta_Frankwolfeacceleration,
      year = {2023},
      booktitle = {Proceedings of The 26th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {206},
      month = jan,
      pages = {77--100},
      url = {https://proceedings.mlr.press/v206/wirth23a.html},
      archiveprefix = {arXiv},
      eprint = {2205.12838},
      arxiv = {arXiv:2205.12838},
      primaryclass = {math.OC},
      author = {Wirth, Elias and Kerdreux, Thomas and Pokutta, Sebastian},
      title = {Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes}
    }

49. 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}
    }

50. 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}
    }

51. 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}
    }

52. Criscitiello, C., Martínez-Rubio, D., and Boumal, N. (2023). Open Problem: Polynomial linearly-convergent method for g-convex optimization? Proceedings of Thirty Sixth Conference on Learning Theory, 195. Associated with COLT 2023. [arXiv]
    [BibTeX]

    @inproceedings{2023_CriscitielloMartinezrubioBoumal_Polynomialconvergence,
      year = {2023},
      booktitle = {Proceedings of Thirty Sixth Conference on Learning Theory},
      series = {Proceedings of Machine Learning Research},
      volume = {195},
      archiveprefix = {arXiv},
      eprint = {2307.12743},
      arxiv = {arXiv:2307.12743},
      primaryclass = {math.OC},
      author = {Criscitiello, Christopher and Martínez-Rubio, David and Boumal, Nicolas},
      title = {Open Problem: Polynomial linearly-convergent method for g-convex optimization?}
    }

53. 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}
    }

54. 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}
    }

55. 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}
    }

56. Búi, M. N., Combettes, P. L., and Woodstock, Z. (2022). Block-Activated Algorithms For Multicomponent Fully Nonsmooth Minimization. ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 5428–5432. Associated with ICASSP 2022. DOI: 10.1109/ICASSP43922.2022.9747479 [URL] [arXiv]
    [BibTeX]

    @inproceedings{2022_BiCombettesWoodstock_Blockactivatedminimization,
      year = {2022},
      booktitle = {ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
      publisher = {Institute of Electrical and Electronics Engineers},
      month = may,
      pages = {5428--5432},
      doi = {10.1109/ICASSP43922.2022.9747479},
      url = {https://zevwoodstock.github.io/media/publications/icassp2022-2.pdf},
      archiveprefix = {arXiv},
      eprint = {2103.00520},
      arxiv = {arXiv:2103.00520},
      primaryclass = {math.OC},
      author = {Búi, M. N. and Combettes, Patrick L. and Woodstock, Zev},
      title = {Block-Activated Algorithms For Multicomponent Fully Nonsmooth Minimization}
    }

57. Wirth, E., and Pokutta, S. (2022). Conditional Gradients for the Approximately Vanishing Ideal. Proceedings of The 25th International Conference on Artificial Intelligence and Statistics, 151. Associated with AISTATS 2022. [arXiv] [summary] [poster] [code]
    [BibTeX]

    @inproceedings{2022_WirthPokutta_Conditionalgradients,
      year = {2022},
      booktitle = {Proceedings of The 25th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {151},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2202.03349},
      arxiv = {arXiv:2202.03349},
      primaryclass = {cs.LG},
      author = {Wirth, Elias and Pokutta, Sebastian},
      title = {Conditional Gradients for the Approximately Vanishing Ideal},
      code = {https://github.com/ZIB-IOL/cgavi/},
      poster = {https://pokutta.com/slides/20220223_CGAVI_poster.pdf},
      summary = {https://pokutta.com/blog/research/2022/02/20/CGAVI.html}
    }

58. Criado, F., Martínez-Rubio, D., and Pokutta, S. (2022). Fast Algorithms for Packing Proportional Fairness and its Dual. Advances in Neural Information Processing Systems, 35, 25754–25766. Associated with NeurIPS 2022. DOI: 10.52202/068431-1867 [arXiv] [poster]
    [BibTeX]

    @inproceedings{2021_CriadoMartinezrubioPokutta_Packingproportionalfairness,
      year = {2022},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {35},
      publisher = {Curran Associates},
      pages = {25754--25766},
      doi = {10.52202/068431-1867},
      archiveprefix = {arXiv},
      eprint = {2109.03678},
      arxiv = {arXiv:2109.03678},
      primaryclass = {math.OC},
      author = {Criado, Francisco and Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Fast Algorithms for Packing Proportional Fairness and its Dual},
      poster = {https://pokutta.com/slides/20211105_fairpacking-poster.pdf}
    }

59. Bestuzheva, K., Völker, H., and Gleixner, A. (2022). Strengthening SONC Relaxations with Constraints Derived from Variable Bounds (pp. 41–44). Accepted at Global Optimization Workshop. [URL] [arXiv]
    [BibTeX]

    @misc{2023_BestuzhevaGleixnerVlker_Soncconstraints:1,
      howpublished = {Accepted at Global Optimization Workshop},
      year = {2022},
      pages = {41--44},
      url = {https://inf.u-szeged.hu/hugo/},
      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}
    }

60. 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}
    }

61. 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}
    }

62. 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}
    }

63. 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}
    }

64. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2021). Projection-Free Optimization on Uniformly Convex Sets. Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, 130, 19–27. Associated with AISTATS 2021. [arXiv] [slides]
    [BibTeX]

    @inproceedings{2021_KerdrexDaspremontPokutta_ProjectionFreeOptimization,
      year = {2021},
      booktitle = {Proceedings of The 24th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {130},
      month = jan,
      pages = {19--27},
      note = {Oral Presentation + Conference Proceedings},
      archiveprefix = {arXiv},
      eprint = {2004.11053},
      arxiv = {arXiv:2004.11053},
      primaryclass = {math.OC},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Projection-Free Optimization on Uniformly Convex Sets},
      slides = {https://app.box.com/s/36wj0o8le96rrfdxec774wk7rrdp2vlm}
    }

65. 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
    [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},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {On the Implementation and Strengthening of Intersection Cuts for QCQPs}
    }

66. 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}
    }

67. Combettes, C., and Pokutta, S. (2020). Boosting Frank-Wolfe by Chasing Gradients. Proceedings of the 37th International Conference on Machine Learning, 119. Associated with ICML 2020. [URL] [arXiv] [slides] [code] [video]
    [BibTeX]

    @inproceedings{2020_CombettesPokutta_BoostingFrankWolfe,
      year = {2020},
      booktitle = {Proceedings of the 37th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {119},
      month = mar,
      url = {https://proceedings.mlr.press/v119/combettes20a.html},
      archiveprefix = {arXiv},
      eprint = {2003.06369},
      arxiv = {arXiv:2003.06369},
      primaryclass = {math.OC},
      author = {Combettes, Cyrille and Pokutta, Sebastian},
      title = {Boosting Frank-Wolfe by Chasing Gradients},
      code = {https://github.com/cyrillewcombettes/boostfw},
      slides = {https://app.box.com/s/wwj247r5d456q0778p9b9y1jm6txuifb},
      video = {https://youtube.com/watch?v=BfyV0C5FRbE}
    }

68. Diakonikolas, J., Carderera, A., and Pokutta, S. (2020). Locally Accelerated Conditional Gradients. Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, 108. Associated with AISTATS 2020. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @inproceedings{2019_DiakonikolasCardereraPokutta_BreakingCurse,
      year = {2020},
      booktitle = {Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {108},
      url = {https://proceedings.mlr.press/v108/diakonikolas20a/diakonikolas20a.pdf},
      archiveprefix = {arXiv},
      eprint = {1906.07867},
      arxiv = {arXiv:1906.07867},
      primaryclass = {math.OC},
      author = {Diakonikolas, Jelena and Carderera, Alejandro and Pokutta, Sebastian},
      title = {Locally Accelerated Conditional Gradients},
      code = {https://colab.research.google.com/drive/1ejjfCan7xnEhWWJXCIzb03CwQRG9iW_O},
      slides = {https://app.box.com/s/gphkhapso7d1vrfnzqykkb3vx0agxh8w}
    }

69. Pokutta, S., Singh, M., and Torrico, A. (2020). On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. Proceedings of the 37th International Conference on Machine Learning, 119. Associated with ICML 2020. [arXiv] [slides] [video]
    [BibTeX]

    @inproceedings{2019_PokuttaSinghTorrico_UnreasonableEffectiveness,
      year = {2020},
      booktitle = {Proceedings of the 37th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {119},
      archiveprefix = {arXiv},
      eprint = {2002.04063},
      arxiv = {arXiv:2002.04063},
      primaryclass = {cs.DS},
      author = {Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
      title = {On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness},
      slides = {https://app.box.com/s/fmjxhfdpiqubm28upf563ohy8t8fgl3a},
      video = {https://youtube.com/watch?v=VB1e0HrDmVo}
    }

70. Braun, G., Pokutta, S., Tu, D., and Wright, S. (2019). Blended Conditional Gradients: the unconditioning of conditional gradients. Proceedings of the 36th International Conference on Machine Learning, 97, 735–743. Associated with ICML 2019. [URL] [arXiv] [summary] [slides] [poster] [code]
    [BibTeX]

    @inproceedings{2018_BraunPokuttaTuStephen_Blendedconditionalgradients,
      year = {2019},
      booktitle = {Proceedings of the 36th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {97},
      pages = {735--743},
      url = {https://proceedings.mlr.press/v97/braun19a},
      archiveprefix = {arXiv},
      eprint = {1805.07311},
      arxiv = {arXiv:1805.07311},
      primaryclass = {math.OC},
      author = {Braun, Gábor and Pokutta, Sebastian and Tu, Dan and Wright, Stephen},
      title = {Blended Conditional Gradients: the unconditioning of conditional gradients},
      code = {https://github.com/pokutta/bcg},
      poster = {https://app.box.com/s/nmmm671jd72i397nysa8emfnzh1hn6hf},
      slides = {https://app.box.com/s/xbx3z7ws6dxvl3rzgj4jp6forigycooe},
      summary = {https://pokutta.com/blog/research/2019/02/18/bcg-abstract.html}
    }

71. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., and Torrico, A. (2019). Structured Robust Submodular Maximization: Offline and Online Algorithms. Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics, 89. Associated with AISTATS 2019. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2019_AnariHaghtalabNaorPokuttaSinghTorrico_StructuredRobustSubmodular:1,
      year = {2019},
      booktitle = {Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {89},
      url = {https://proceedings.mlr.press/v89/anari19a/anari19a.pdf},
      archiveprefix = {arXiv},
      eprint = {1710.04740},
      arxiv = {arXiv:1710.04740},
      primaryclass = {cs.DS},
      author = {Anari, N. and Haghtalab, N. and Naor, S. and Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
      title = {Structured Robust Submodular Maximization: Offline and Online Algorithms}
    }

72. Combettes, C., and Pokutta, S. (2019). Blended Matching Pursuit. Advances in Neural Information Processing Systems, 32, 2042–2052. Associated with NeurIPS 2019. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @inproceedings{2019_CombettesPokutta_BlendedMatching,
      year = {2019},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {32},
      publisher = {Curran Associates},
      pages = {2042--2052},
      url = {https://papers.nips.cc/paper/8478-blended-matching-pursuit},
      archiveprefix = {arXiv},
      eprint = {1904.12335},
      arxiv = {arXiv:1904.12335},
      primaryclass = {math.OC},
      author = {Combettes, Cyrille and Pokutta, Sebastian},
      title = {Blended Matching Pursuit},
      code = {https://colab.research.google.com/drive/17XYIxnCcJjKswba9mAaXFWnNGVZdsaXQ},
      slides = {https://app.box.com/s/8lfktq6h3dqp9t2gqydu2tp8h2uxgz7m}
    }

73. Diakonikolas, J., Carderera, A., and Pokutta, S. (2019). Breaking the Curse of Dimensionality (Locally) to Accelerate Conditional Gradients. Accepted at Optimization for Machine Learning. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @misc{2019_DiakonikolasCardereraPokutta_BreakingCurse:1,
      howpublished = {Accepted at Optimization for Machine Learning},
      year = {2019},
      url = {https://opt-ml.org/papers/2019/paper_26.pdf},
      archiveprefix = {arXiv},
      eprint = {1906.07867},
      arxiv = {arXiv:1906.07867},
      primaryclass = {math.OC},
      author = {Diakonikolas, Jelena and Carderera, Alejandro and Pokutta, Sebastian},
      title = {Breaking the Curse of Dimensionality (Locally) to Accelerate Conditional Gradients},
      code = {https://colab.research.google.com/drive/1ejjfCan7xnEhWWJXCIzb03CwQRG9iW_O},
      slides = {https://app.box.com/s/gphkhapso7d1vrfnzqykkb3vx0agxh8w}
    }

74. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2019). Restarting Frank-Wolfe. Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics, 89, 1275–1283. Associated with AISTATS 2019. [URL] [arXiv] [slides]
    [BibTeX]

    @inproceedings{2019_KerdrexDaspremontPokutta_RestartingFrankWolfe:1,
      year = {2019},
      booktitle = {Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {89},
      pages = {1275--1283},
      url = {https://proceedings.mlr.press/v89/kerdreux19a/kerdreux19a.pdf},
      archiveprefix = {arXiv},
      eprint = {1810.02429},
      arxiv = {arXiv:1810.02429},
      primaryclass = {math.OC},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Restarting Frank-Wolfe},
      slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5}
    }

75. Pokutta, S., Singh, M., and Torrico, A. (2019). On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. Accepted at Optimization for Machine Learning. [URL] [arXiv] [slides] [video]
    [BibTeX]

    @misc{2019_PokuttaSinghTorrico_UnreasonableEffectiveness:1,
      howpublished = {Accepted at Optimization for Machine Learning},
      year = {2019},
      url = {https://opt-ml.org/papers/2019/paper_16.pdf},
      archiveprefix = {arXiv},
      eprint = {2002.04063},
      arxiv = {arXiv:2002.04063},
      primaryclass = {cs.DS},
      author = {Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
      title = {On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness},
      slides = {https://app.box.com/s/fmjxhfdpiqubm28upf563ohy8t8fgl3a},
      video = {https://youtube.com/watch?v=VB1e0HrDmVo}
    }

76. Pokutta, S., Singh, M., and Torrico, A. (2018). Efficient algorithms for robust submodular maximization under matroid constraints. Accepted at ICML 2018: Modern Trends in Nonconvex Optimization for Machine Learning. [URL] [arXiv]
    [BibTeX]

    @misc{2018_PokuttaSinghTorrico_EfficientAlgorithms:1,
      howpublished = {Accepted at ICML 2018: Modern Trends in Nonconvex Optimization for Machine Learning},
      year = {2018},
      url = {https://sites.google.com/view/icml2018nonconvex/papers},
      archiveprefix = {arXiv},
      eprint = {1807.09405},
      arxiv = {arXiv:1807.09405},
      primaryclass = {cs.DS},
      author = {Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
      title = {Efficient algorithms for robust submodular maximization under matroid constraints}
    }

77. Braun, G., Pokutta, S., and Zink, D. (2017). Lazifying Conditional Gradient Algorithms. Proceedings of the 34th International Conference on Machine Learning, 70, 566–575. Associated with ICML 2017. [URL] [arXiv] [slides] [poster]
    [BibTeX]

    @inproceedings{2016_BraunPokuttaZink_Lazifyinggradientalgorithms:1,
      year = {2017},
      booktitle = {Proceedings of the 34th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {70},
      pages = {566--575},
      url = {https://proceedings.mlr.press/v70/braun17a},
      archiveprefix = {arXiv},
      eprint = {1610.05120},
      arxiv = {arXiv:1610.05120},
      primaryclass = {cs.DS},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Lazifying Conditional Gradient Algorithms},
      poster = {https://app.box.com/s/lysscdg17ytpz7mqr0tu2djffyqvkl6a},
      slides = {https://app.box.com/s/zsp0hixjz2ha23u1vuyosijjkjdh8k}
    }

78. Lan, G., Pokutta, S., Zhou, Y., and Zink, D. (2017). Conditional Accelerated Lazy Stochastic Gradient Descent. Proceedings of the 34th International Conference on Machine Learning, 70, 1965–1974. Associated with ICML 2017. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2017_LanPokuttaZhouZink_ConditionalAccelerated,
      year = {2017},
      booktitle = {Proceedings of the 34th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {70},
      pages = {1965--1974},
      url = {https://proceedings.mlr.press/v70/lan17a.html},
      archiveprefix = {arXiv},
      eprint = {1703.05840},
      arxiv = {arXiv:1703.05840},
      primaryclass = {cs.LG},
      author = {Lan, G. and Pokutta, Sebastian and Zhou, Y and Zink, Daniel},
      title = {Conditional Accelerated Lazy Stochastic Gradient Descent}
    }

79. Braun, G., Pokutta, S., and Roy, A. (2016). Strong Reductions for Extended Formulations. Integer Programming and Combinatorial Optimization, 9682, 350–361. Associated with IPCO 2016. DOI: 10.1007/978-3-319-33461-5_29 [arXiv]
    [BibTeX]

    @inproceedings{2015_BraunPokuttaRoy_Strongreductions:1,
      year = {2016},
      booktitle = {Integer Programming and Combinatorial Optimization},
      series = {Lecture Notes in Computer Science},
      volume = {9682},
      publisher = {Springer Science+Business Media},
      month = may,
      pages = {350--361},
      doi = {10.1007/978-3-319-33461-5_29},
      archiveprefix = {arXiv},
      eprint = {1512.04932},
      arxiv = {arXiv:1512.04932},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
      title = {Strong Reductions for Extended Formulations}
    }

80. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2016). The matching problem has no small symmetric SDP. Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1067–1078. Associated with SODA 2016. DOI: 10.1137/1.9781611974331.ch75 [arXiv]
    [BibTeX]

    @inproceedings{2015_BraunEtAl_MatchingproblemSdp:1,
      year = {2016},
      booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms},
      publisher = {Society for Industrial and Applied Mathematics},
      pages = {1067--1078},
      doi = {10.1137/1.9781611974331.ch75},
      archiveprefix = {arXiv},
      eprint = {1504.00703},
      arxiv = {arXiv:1504.00703},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Brown-Cohen, Jonah and Huq, Arefin and Pokutta, Sebastian and Raghavendra, Prasad and Roy, Aurko and Weitz, Benjamin and Zink, Daniel},
      title = {The matching problem has no small symmetric SDP}
    }

81. Roy, A., and Pokutta, S. (2016). Hierarchical Clustering via Spreading Metrics. Advances in Neural Information Processing Systems, 29. Associated with NeurIPS 2016. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2017_RoyPokutta_HierarchicalClustering:1,
      year = {2016},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {29},
      publisher = {Curran Associates},
      note = {Oral Presentation + Conference Proceedings},
      url = {https://papers.nips.cc/paper/by-source-2016-1199},
      archiveprefix = {arXiv},
      eprint = {1610.09269},
      arxiv = {arXiv:1610.09269},
      primaryclass = {cs.LG},
      author = {Roy, Aurko and Pokutta, Sebastian},
      title = {Hierarchical Clustering via Spreading Metrics}
    }

82. Braun, G., Pokutta, S., and Zink, D. (2015). Inapproximability of combinatorial problems via small LPs and SDPs. Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, 107–116. Associated with STOC 2015. DOI: 10.1145/2746539.2746550 [arXiv] [video]
    [BibTeX]

    @inproceedings{2014_BraunPokuttaZink_Affinereductions:1,
      year = {2015},
      booktitle = {Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing},
      publisher = {Association for Computing Machinery},
      month = jun,
      pages = {107--116},
      doi = {10.1145/2746539.2746550},
      archiveprefix = {arXiv},
      eprint = {1410.8816},
      arxiv = {arXiv:1410.8816},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Inapproximability of combinatorial problems via small LPs and SDPs},
      video = {https://youtu.be/MxLEticZ8RY}
    }

83. Braun, G., and Pokutta, S. (2015). The matching polytope does not admit fully-polynomial size relaxation schemes. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 837–846. Associated with SODA 2015. DOI: 10.1137/1.9781611973730.57 [URL] [arXiv]
    [BibTeX]

    @inproceedings{2014_BraunPokutta_Matchingpolytope:1,
      year = {2015},
      booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms},
      publisher = {Society for Industrial and Applied Mathematics},
      pages = {837--846},
      doi = {10.1137/1.9781611973730.57},
      url = {https://eccc.weizmann.ac.il/report/2013/056},
      archiveprefix = {arXiv},
      eprint = {1403.6710},
      arxiv = {arXiv:1403.6710},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {The matching polytope does not admit fully-polynomial size relaxation schemes}
    }

84. Braun, G., Fiorini, S., and Pokutta, S. (2014). Average Case Polyhedral Complexity of the Maximum Stable Set Problem. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014), 28, 515–530. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.515 [URL] [arXiv]
    [BibTeX]

    @inproceedings{2013_BraunSamuelPokutta_Averagepolyhedralcomplexity:1,
      year = {2014},
      booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
      series = {Leibniz International Proceedings in Informatics},
      volume = {28},
      publisher = {Schloss Dagstuhl – Leibniz Center for Informatics},
      month = sep,
      pages = {515--530},
      doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.515},
      url = {https://drops.dagstuhl.de/opus/volltexte/2014/4720},
      archiveprefix = {arXiv},
      eprint = {1311.4001},
      arxiv = {arXiv:1311.4001},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Fiorini, Samuel and Pokutta, Sebastian},
      title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem}
    }

85. Braun, G., Pokutta, S., and Xie, Y. (2014). Info-greedy sequential adaptive compressed sensing. 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 858–865. Associated with Allerton 2014. DOI: 10.1109/ALLERTON.2014.7028544 [arXiv]
    [BibTeX]

    @inproceedings{2014_BraunPokuttaYao_Infogreedycompressedsensing:1,
      year = {2014},
      booktitle = {2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
      publisher = {Institute of Electrical and Electronics Engineers},
      pages = {858--865},
      doi = {10.1109/ALLERTON.2014.7028544},
      archiveprefix = {arXiv},
      eprint = {1407.0731},
      arxiv = {arXiv:1407.0731},
      primaryclass = {cs.IT},
      author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao},
      title = {Info-greedy sequential adaptive compressed sensing}
    }

86. Braun, G., and Pokutta, S. (2013). Common Information and Unique Disjointness. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 688–697. Associated with FOCS 2013. DOI: 10.1109/FOCS.2013.79 [URL]
    [BibTeX]

    @inproceedings{2016_BraunPokutta_CommoninformationDisjointness:1,
      year = {2013},
      booktitle = {2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
      publisher = {Institute of Electrical and Electronics Engineers},
      pages = {688--697},
      doi = {10.1109/FOCS.2013.79},
      url = {https://eccc.weizmann.ac.il/report/2013/056},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Common Information and Unique Disjointness}
    }

87. Braun, G., and Pokutta, S. (2012). An Algebraic Approach to Symmetric Extended Formulations. Combinatorial Optimization, 7422, 141–152. Associated with ISCO 2012. DOI: 10.1007/978-3-642-32147-4_14 [arXiv]
    [BibTeX]

    @inproceedings{2012_BraunPokutta_Algebraicsymmetricformulations,
      year = {2012},
      booktitle = {Combinatorial Optimization},
      series = {Lecture Notes in Computer Science},
      volume = {7422},
      publisher = {Springer Science+Business Media},
      month = apr,
      pages = {141--152},
      doi = {10.1007/978-3-642-32147-4_14},
      archiveprefix = {arXiv},
      eprint = {1206.6318},
      arxiv = {arXiv:1206.6318},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {An Algebraic Approach to Symmetric Extended Formulations}
    }

88. Braun, G., Fiorini, S., Pokutta, S., and Steurer, D. (2012). Approximation Limits of Linear Programs (Beyond Hierarchies). 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 480–489. Associated with FOCS 2012. DOI: 10.1109/FOCS.2012.10 [arXiv]
    [BibTeX]

    @inproceedings{2012_BraunSamuelPokuttaSteurer_Approximationlimits:1,
      year = {2012},
      booktitle = {2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
      publisher = {Institute of Electrical and Electronics Engineers},
      pages = {480--489},
      doi = {10.1109/FOCS.2012.10},
      archiveprefix = {arXiv},
      eprint = {1204.0957},
      arxiv = {arXiv:1204.0957},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Fiorini, Samuel and Pokutta, Sebastian and Steurer, David},
      title = {Approximation Limits of Linear Programs (Beyond Hierarchies)}
    }

89. Braun, G., and Pokutta, S. (2010). Rank of random half-integral polytopes. Electronic Notes in Discrete Mathematics, 36, 415–422. Associated with ISCO 2010. DOI: 10.1016/j.endm.2010.05.053 [URL]
    [BibTeX]

    @article{2011_BraunPokutta_Randomhalfintegralpolytopes:1,
      year = {2010},
      date = {2010-08-01},
      journal = {Electronic Notes in Discrete Mathematics},
      volume = {36},
      month = aug,
      pages = {415--422},
      doi = {10.1016/j.endm.2010.05.053},
      url = {https://optimization-online.org/?p=2010/11/2813},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Rank of random half-integral polytopes}
    }