Mathieu Besançon

38 papers A* 3A 2B 3Journal 28Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Convex mixed-integer optimization with Frank-Wolfe methods. Math. Program. Comput. Deborah Hendrych, Hannah Troppens, Mathieu Besançon, Sebastian Pokutta
2025	A	`conf`	Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly. ECAI Mathieu Besançon
2025	J	`jnl`	Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly. CoRR Mathieu Besançon
2025	J	`jnl`	Improved Algorithms and Novel Applications of the FrankWolfe.jl Library. ACM Trans. Math. Softw. Mathieu Besançon, Sébastien Designolle, Jannis Halbey, Deborah Hendrych, Dominik Kuzinowicz, Sebastian Pokutta, Hannah Troppens, Daniel Viladrich Herrmannsdoerfer, Elias Samuel Wirth
2025	J	`jnl`	Improved algorithms and novel applications of the FrankWolfe.jl library. CoRR Mathieu Besançon, Sébastien Designolle, Jannis Halbey, Deborah Hendrych, Dominik Kuzinowicz, Sebastian Pokutta, Hannah Troppens, Daniel Viladrich Herrmannsdoerfer, Elias Samuel Wirth
2025	B	`conf`	Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks. SEA Hannah Troppens, Mathieu Besançon, St. Elmo Wilken, Sebastian Pokutta
2025	A*	`conf`	Secant Line Search for Frank-Wolfe Algorithms. ICML Deborah Hendrych, Sebastian Pokutta, Mathieu Besançon, David Martínez-Rubio
2025	A	`conf`	The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control. AISTATS Mathieu Besançon, Sebastian Pokutta, Elias Samuel Wirth
2024	J	`jnl`	A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP. CoRR Suresh Bolusani, Gioni Mexi, Mathieu Besançon, Mark Turner
2024	—	`conf`	A Multi-reference Relaxation Enforced Neighborhood Search Heuristic in SCIP. OR Suresh Bolusani, Gioni Mexi, Mathieu Besançon, Mark Turner
2024	J	`jnl`	Flexible Differentiable Optimization via Model Transformations. INFORMS J. Comput. Mathieu Besançon, Joaquim Dias Garcia, Benoît Legat, Akshay Sharma
2024	J	`jnl`	How many clues to give? A bilevel formulation for the minimum Sudoku clue problem. Oper. Res. Lett. Gennesaret Tjusila, Mathieu Besançon, Mark Turner, Thorsten Koch
2024	—	`conf`	Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model. CPAIOR (2) Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic
2024	J	`jnl`	Robust bilevel optimization for near-optimal lower-level solutions. J. Glob. Optim. Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne
2024	J	`jnl`	Scalable Frank-Wolfe on Generalized Self-Concordant Functions via Simple Steps. SIAM J. Optim. Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta
2024	B	`conf`	Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods. SEA Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta
2024	J	`jnl`	The MIP Workshop 2023 Computational Competition on reoptimization. Math. Program. Comput. Suresh Bolusani, Mathieu Besançon, Ambros M. Gleixner, Timo Berthold, Claudia D'Ambrosio, Gonzalo Muñoz, Joseph Paat, Dimitri Thomopulos
2023	J	`jnl`	A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. CoRR Mark Turner, Timo Berthold, Mathieu Besançon
2023	J	`jnl`	Branching via Cutting Plane Selection: Improving Hybrid Branching. CoRR Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch
2023	B	`conf`	Cutting Plane Selection with Analytic Centers and Multiregression. CPAIOR Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch
2023	J	`jnl`	Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. Ksenia Bestuzheva, Mathieu Besançon, Weikun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros M. Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco E. Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig
2023	J	`jnl`	How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem. CoRR Gennesaret Tjusila, Mathieu Besançon, Mark Turner, Thorsten Koch
2023	J	`jnl`	Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization. CoRR Gioni Mexi, Mathieu Besançon, Suresh Bolusani, Antonia Chmiela, Alexander Hoen, Ambros M. Gleixner
2022	J	`jnl`	Convex integer optimization with Frank-Wolfe methods. CoRR Deborah Hendrych, Hannah Troppens, Mathieu Besançon, Sebastian Pokutta
2022	J	`jnl`	Cutting Plane Selection with Analytic Centers and Multiregression. CoRR Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch
2022	J	`jnl`	Flexible Differentiable Optimization via Model Transformations. CoRR Akshay Sharma, Mathieu Besançon, Joaquim Dias Garcia, Benoît Legat
2022	J	`jnl`	FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients. INFORMS J. Comput. Mathieu Besançon, Alejandro Carderera, Sebastian Pokutta
2022	A*	`conf`	Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings. ICML Jan MacDonald, Mathieu Besançon, Sebastian Pokutta
2021	J	`jnl`	Complexity of near-optimal robust versions of multilevel optimization problems. Optim. Lett. Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne
2021	J	`jnl`	Distributions.jl: Definition and Modeling of Probability Distributions in the JuliaStats Ecosystem. J. Stat. Softw. Mathieu Besançon, Theodore Papamarkou, David Anthoff, Alex Arslan, Simon Byrne, Dahua Lin, John Pearson
2021	J	`jnl`	Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings. CoRR Jan MacDonald, Mathieu Besançon, Sebastian Pokutta
2021	A*	`conf`	Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions. NeurIPS Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta
2021	J	`jnl`	Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions. CoRR Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta
2020	J	`jnl`	A Bilevel Approach for Optimal Price-Setting of Time-and-Level-of-Use Tariffs. IEEE Trans. Smart Grid Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne, Juan A. Gómez-Herrera
2020	J	`jnl`	Complexity of near-optimal robust versions of multilevel optimization problems. CoRR Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne
2019	J	`jnl`	A Julia package for bilevel optimization problems. J. Open Source Softw. Mathieu Besançon
2019	J	`jnl`	Distributions.jl: Definition and Modeling of Probability Distributions in the JuliaStats Ecosystem. CoRR Mathieu Besançon, David Anthoff, Alex Arslan, Simon Byrne, Dahua Lin, Theodore Papamarkou, John Pearson
2019	J	`jnl`	Near-optimal Robust Bilevel Optimization. CoRR Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne