| Reinforcement learning for integer programming: Learning to cut Y Tang, S Agrawal, Y Faenza International conference on machine learning, 9367-9376, 2020 | 74 | 2020 |
| An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem Y Faenza, G Oriolo, G Stauffer Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 61* | 2011 |
| Extended formulations, nonnegative factorizations, and randomized communication protocols Y Faenza, S Fiorini, R Grappe, HR Tiwary Mathematical Programming 153 (1), 75-94, 2015 | 57 | 2015 |
| On largest volume simplices and sub-determinants MD Summa, F Eisenbrand, Y Faenza, C Moldenhauer Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 54 | 2014 |
| Solving the weighted stable set problem in claw-free graphs via decomposition Y Faenza, G Oriolo, G Stauffer Journal of the ACM (JACM) 61 (4), 1-41, 2014 | 42 | 2014 |
| Popular matchings and limits to tractability Y Faenza, T Kavitha, V Powers, X Zhang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 36 | 2019 |
| Extended formulations for packing and partitioning orbitopes Y Faenza, V Kaibel Mathematics of Operations Research 34 (3), 686-697, 2009 | 36 | 2009 |
| Solving the stable set problem in terms of the odd cycle packing number A Bock, Y Faenza, C Moldenhauer, AJ Ruiz-Vargas 34th International Conference on Foundation of Software Technology and …, 2014 | 22 | 2014 |
| Enumeration of 2-level polytopes A Bohn, Y Faenza, S Fiorini, V Fisikopoulos, M Macchia, K Pashkovich Mathematical Programming Computation 11 (1), 173-210, 2019 | 21* | 2019 |
| On 2-level polytopes arising in combinatorial settings M Aprile, A Cevallos, Y Faenza SIAM Journal on Discrete Mathematics 32 (3), 1857-1886, 2018 | 18* | 2018 |
| Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs Y Faenza, G Oriolo, G Stauffer Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012 | 15* | 2012 |
| Quasi-popular matchings, optimality, and extended formulations Y Faenza, T Kavitha Mathematics of Operations Research 47 (1), 427-457, 2022 | 14 | 2022 |
| Extension complexity of stable set polytopes of bipartite graphs M Aprile, Y Faenza, S Fiorini, T Huynh, M Macchia International Workshop on Graph-Theoretic Concepts in Computer Science, 75-87, 2017 | 13 | 2017 |
| Reverse Chvátal--Gomory Rank M Conforti, A Del Pia, M Di Summa, Y Faenza, R Grappe SIAM Journal on Discrete Mathematics 29 (1), 166-181, 2015 | 11 | 2015 |
| Extended formulations from communication protocols in output-efficient time M Aprile, Y Faenza Mathematical Programming 183, 41-59, 2020 | 10 | 2020 |
| A PTAS for the time-invariant incremental knapsack problem Y Faenza, I Malinovic International Symposium on Combinatorial Optimization, 157-169, 2018 | 9* | 2018 |
| On coloring problems with local constraints F Bonomo, Y Faenza, G Oriolo Discrete Mathematics 312 (12-13), 2027-2039, 2012 | 9 | 2012 |
| New limits of treewidth-based tractability in optimization Y Faenza, G Muñoz, S Pokutta Mathematical Programming, 1-36, 2020 | 7* | 2020 |
| Balas formulation for the union of polytopes is optimal M Conforti, M Di Summa, Y Faenza Mathematical Programming 180 (1), 311-326, 2020 | 7 | 2020 |
| On inequalities with bounded coefficients and pitch for the min knapsack polytope D Bienstock, Y Faenza, I Malinović, M Mastrolilli, O Svensson, ... Discrete Optimization, 100567, 2020 | 7* | 2020 |
Samuel FioriniUniversité libre de BruxellesΗ διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα ulb.ac.be
