Ayse Arslan
Publications
Publications
|
|
A semi-infinite constraint generation algorithm for adjustable robust optimizationROADEF 2025 - 26ème congrès annuel de la société française de recherche opérationnelle et d'aide à la décision, Feb 2025, Champ-sur-Marne, France |
|
|
A Generic Branch-and-Bound for L0-Penalized ProblemsJournées SMAI MODE 2024, Mar 2024, Lyon, France. pp.1-1 |
|
|
Node-screening pour le problème des moindres carrés avec pénalité L0GRETSI 2022 - XXVIIIème Colloque Francophone de Traitement du Signal et des Images, Sep 2022, Nancy, France. pp.1-4 |
|
|
Une approche de décomposition pour des problèmes robustes avec recours entier20ème congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision ROADEF2019, Feb 2019, Le Havre, France |
|
|
Decomposition approaches for two-stage robust binary optimizationICSP2019 - XV International Conference on Stochastic Programming, Jul 2019, Trondheim, Norway |
|
|
A semi-infinite constraint generation algorithm for two-stage robust optimization problems2025 |
|
|
Two-stage and Lagrangian Dual Decision Rules for Multistage Adaptive Robust Optimization2024 |
|
|
Robust Strategic Planning of Phytosanitary Treatments in Agriculture2021 |
|
|
A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized ProblemsProceedings of Machine Learning Research, 2024, 235, pp.48077-48096 |
|
|
KidneyExchange.jl: A Julia package for solving the kidney exchange problem with branch-and-priceMathematical Programming Computation, 2024, 16 (1), pp.151-184. ⟨10.1007/s12532-023-00251-7⟩ |
|
|
Uncertainty reduction in robust optimizationOperations Research Letters, 2024, 55, pp.107131. ⟨10.1016/j.orl.2024.107131⟩ |
|
|
Min-sup-min robust combinatorial optimization with few recourse solutionsINFORMS Journal on Computing, 2022, 34 (4), pp.1841-2382. ⟨10.1287/ijoc.2021.1156⟩ |
|
|
Decomposition-based approaches for a class of two-stage robust binary optimization problemsINFORMS Journal on Computing, 2022, 34 (2), ⟨10.1287/ijoc.2021.1061⟩ |