Yuri Faenza
Title
Cited by
Cited by
Year
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
57*2011
Extended formulations, nonnegative factorizations, and randomized communication protocols
Y Faenza, S Fiorini, R Grappe, HR Tiwary
Mathematical Programming 153 (1), 75-94, 2015
502015
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
332014
Extended formulations for packing and partitioning orbitopes
Y Faenza, V Kaibel
Mathematics of Operations Research 34 (3), 686-697, 2009
332009
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
322014
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
172019
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
152014
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
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
14*2019
Reinforcement learning for integer programming: Learning to cut
Y Tang, S Agrawal, Y Faenza
International Conference on Machine Learning, 9367-9376, 2020
132020
On 2-level polytopes arising in combinatorial settings
M Aprile, A Cevallos, Y Faenza
SIAM Journal on Discrete Mathematics 32 (3), 1857-1886, 2018
10*2018
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
102015
On coloring problems with local constraints
F Bonomo, Y Faenza, G Oriolo
Discrete Mathematics 312 (12-13), 2027-2039, 2012
82012
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
72017
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
Y Faenza, G Oriolo, C Snels
Operations research letters 39 (3), 213-217, 2011
62011
Quasi-popular matchings, optimality, and extended formulations
Y Faenza, T Kavitha
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete†…, 2020
42020
A PTAS for the Time-Invariant Incremental Knapsack Problem
Y Faenza, I Malinovic
International Symposium on Combinatorial Optimization, 157-169, 2018
4*2018
On the existence of compact ε-approximated formulations for knapsack in the original space
Y Faenza, L Sanitŗ
Operations Research Letters 43 (3), 339-342, 2015
42015
On the Convergence of the Affine Hull of the ChvŠtal--Gomory Closures
G Averkov, M Conforti, A Del Pia, M Di Summa, Y Faenza
SIAM Journal on Discrete Mathematics 27 (3), 1492-1502, 2013
42013
Reverse split rank
M Conforti, A Del Pia, M Di Summa, Y Faenza
Mathematical Programming 154 (1-2), 273-303, 2015
32015
The system can't perform the operation now. Try again later.
Articles 1–20