default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathieu Besançon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Mathieu Besançon
, Joaquim Dias Garcia, Benoît Legat, Akshay Sharma:
Flexible Differentiable Optimization via Model Transformations. INFORMS J. Comput. 36(2): 456-478 (2024)- [j9]Suresh Bolusani, Mathieu Besançon, Ambros M. Gleixner, Timo Berthold, Claudia D'Ambrosio, Gonzalo Muñoz, Joseph Paat, Dimitri Thomopulos:
The MIP Workshop 2023 Computational Competition on reoptimization. Math. Program. Comput. 16(2): 255-266 (2024) - [j8]Gennesaret Tjusila, Mathieu Besançon, Mark Turner, Thorsten Koch:
How many clues to give? A bilevel formulation for the minimum Sudoku clue problem. Oper. Res. Lett. 54: 107105 (2024) - [j7]Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta:
Scalable Frank-Wolfe on Generalized Self-Concordant Functions via Simple Steps. SIAM J. Optim. 34(3): 2231-2258 (2024) - [c5]Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic:
Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model. CPAIOR (2) 2024: 56-73 - [c4]Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta:
Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods. SEA 2024: 16:1-16:22 - [i13]Suresh Bolusani, Gioni Mexi, Mathieu Besançon, Mark Turner:
A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP. CoRR abs/2408.00718 (2024) - 2023
- [j6]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:
Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. 49(2): 22:1-22:21 (2023) - [c3]Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch:
Cutting Plane Selection with Analytic Centers and Multiregression. CPAIOR 2023: 52-68 - [i12]Gennesaret Tjusila, Mathieu Besançon, Mark Turner, Thorsten Koch:
How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem. CoRR abs/2305.01697 (2023) - [i11]Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch:
Branching via Cutting Plane Selection: Improving Hybrid Branching. CoRR abs/2306.06050 (2023) - [i10]Gioni Mexi, Mathieu Besançon, Suresh Bolusani, Antonia Chmiela, Alexander Hoen, Ambros M. Gleixner:
Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization. CoRR abs/2307.03466 (2023) - [i9]Mark Turner, Timo Berthold, Mathieu Besançon:
A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. CoRR abs/2307.07322 (2023) - 2022
- [j5]Mathieu Besançon, Alejandro Carderera, Sebastian Pokutta:
FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients. INFORMS J. Comput. 34(5): 2611-2620 (2022) - [c2]Jan MacDonald, Mathieu Besançon, Sebastian Pokutta:
Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings. ICML 2022: 14699-14716 - [i8]Akshay Sharma, Mathieu Besançon, Joaquim Dias Garcia, Benoît Legat:
Flexible Differentiable Optimization via Model Transformations. CoRR abs/2206.06135 (2022) - [i7]Deborah Hendrych, Hannah Troppens, Mathieu Besançon, Sebastian Pokutta:
Convex integer optimization with Frank-Wolfe methods. CoRR abs/2208.11010 (2022) - [i6]Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch:
Cutting Plane Selection with Analytic Centers and Multiregression. CoRR abs/2212.07231 (2022) - 2021
- [j4]Mathieu Besançon, Theodore Papamarkou, David Anthoff, Alex Arslan, Simon Byrne, Dahua Lin, John Pearson:
Distributions.jl: Definition and Modeling of Probability Distributions in the JuliaStats Ecosystem. J. Stat. Softw. 98(1) (2021) - [j3]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Complexity of near-optimal robust versions of multilevel optimization problems. Optim. Lett. 15(8): 2597-2610 (2021) - [c1]Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta:
Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions. NeurIPS 2021: 5390-5401 - [i5]Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta:
Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions. CoRR abs/2105.13913 (2021) - [i4]Jan MacDonald, Mathieu Besançon, Sebastian Pokutta:
Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings. CoRR abs/2110.08105 (2021) - 2020
- [j2]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne, Juan A. Gómez-Herrera:
A Bilevel Approach for Optimal Price-Setting of Time-and-Level-of-Use Tariffs. IEEE Trans. Smart Grid 11(6): 5462-5465 (2020) - [i3]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Complexity of near-optimal robust versions of multilevel optimization problems. CoRR abs/2011.00824 (2020)
2010 – 2019
- 2019
- [j1]Mathieu Besançon:
A Julia package for bilevel optimization problems. J. Open Source Softw. 4(39): 1278 (2019) - [i2]Mathieu Besançon, David Anthoff, Alex Arslan, Simon Byrne, Dahua Lin, Theodore Papamarkou, John Pearson:
Distributions.jl: Definition and Modeling of Probability Distributions in the JuliaStats Ecosystem. CoRR abs/1907.08611 (2019) - [i1]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Near-optimal Robust Bilevel Optimization. CoRR abs/1908.04040 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
