A complete list of publications can be found on my Google Scholar profile.

A generic Branch-and-Bound algorithm for L0-regularized problems
Théo Guyard, Cédric Herzet, and Clément Elvira.
[Preprint to appear]

A new Branch-and-Bound pruning framework for L0-regularized problems
2024, ICML, Théo Guyard, Cédric Herzet, Clément Elvira and Ayşe-Nur Arslan
[Paper] [Citation] [Code]
Safe peeling for L0-regularized least-squares
2023, EUSIPCO, Théo Guyard, Gilles Monnoyer, Cédric Herzet and Clément Elvira
[Paper] [Citation] [Code] [Supplement]
Node-screening tests for L0-penalized least-squares problem
2022, ICASSP, Théo Guyard, Cédric Herzet and Clément Elvira
[Paper] [Citation] [Code] [Supplement]
2023 ROADEF best student paper award
2023 SMAI-MODE best poster award
Screen & Relax: Accelerating the resolution of Elastic-net by safe identification of the solution support
2022, ICASSP, Théo Guyard, Cédric Herzet and Clément Elvira
[Paper] [Citation] [Code] [Supplement]

Peeling pour le problème des moindres carrés avec régularisation L0
2023, GRETSI, Théo Guyard, Gilles Monnoyer, Cédric Herzet and Clément Elvira
[Paper] [Citation] [Code]
An efficient solver for L0-penalized sparse problems
2023, ROADEF, Théo Guyard
[Paper] [Citation] [Code]
Node-screening pour le problème des moindres carrés avec pénalité L0
2022, GRETSI, Théo Guyard, Cédric Herzet, Clément Elvira and Ayşe-Nur Arslan
[Paper] [Citation] [Code]
Screen & Relax: Accélérer la résolution du problème "Elastic-Net" par identification du support de la solution
2022, GRETSI, Théo Guyard, Cédric Herzet and Clément Elvira
[Paper] [Citation] [Code]

Branch-and-bound algorithms for L0-regularized problems
2024, PhD thesis, Théo Guyard
[Manuscript] [Summary] [Code]
Acceleration methods for L0 and L1 problems
2021, Engineering thesis, Théo Guyard
Stochastic models for Kidney Exchange Programs
2020, Research project thesis, Théo Guyard
[Manuscript] [Code]