Общедоступные статьи - Yuri FaenzaПодробнее...
1 статья недоступна нигде
Separation routine and extended formulations for the stable set problem in claw-free graphs
Y Faenza, G Oriolo, G Stauffer
Mathematical Programming, 2020
Финансирование: Swiss National Science Foundation
25 статей доступны в некоторых источниках
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
Финансирование: Swiss National Science Foundation, German Research Foundation
Extended formulations, nonnegative factorizations, and randomized communication protocols
Y Faenza, S Fiorini, R Grappe, HR Tiwary
Mathematical Programming 153 (1), 75-94, 2015
Финансирование: National Fund for Scientific Research, Belgium, German Research Foundation
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
Финансирование: German Research Foundation
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
Финансирование: Swiss National Science Foundation, German Research Foundation
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
Финансирование: Swiss National Science Foundation, Australian Research Council, National …
Quasi-popular matchings, optimality, and extended formulations
Y Faenza, T Kavitha
Mathematics of Operations Research 47 (1), 427-457, 2022
Финансирование: US National Science Foundation
On 2-level polytopes arising in combinatorial settings
M Aprile, A Cevallos, Y Faenza
SIAM Journal on Discrete Mathematics 32 (3), 1857-1886, 2018
Финансирование: Swiss National Science Foundation
Extension complexity of stable set polytopes of bipartite graphs
M Aprile, Y Faenza, S Fiorini, T Huynh, M Macchia
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
Финансирование: Swiss National Science Foundation, European Commission
A PTAS for the time-invariant incremental knapsack problem
Y Faenza, I Malinovic
Combinatorial Optimization: 5th International Symposium, ISCO 2018 …, 2018
Финансирование: Swiss National Science Foundation
Approximation algorithms for the generalized incremental knapsack problem
Y Faenza, D Segev, L Zhang
Mathematical Programming 198 (1), 27-83, 2023
Финансирование: US Department of Defense
Balas formulation for the union of polytopes is optimal
M Conforti, M Di Summa, Y Faenza
Mathematical Programming 180, 311-326, 2020
Финансирование: Swiss National Science Foundation
Affinely representable lattices, stable matchings, and choice functions
Y Faenza, X Zhang
Mathematical Programming 197 (2), 721-760, 2023
Финансирование: US National Science Foundation, US Department of Defense
Understanding popular matchings via stable matchings
A Cseh, Y Faenza, T Kavitha, V Powers
SIAM Journal on Discrete Mathematics 36 (1), 188-213, 2022
Финансирование: Magyar Tudományos Akadémia, Hungarian Scientific Research Fund, European …
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
Финансирование: German Research Foundation
On inequalities with bounded coefficients and pitch for the min knapsack polytope
D Bienstock, Y Faenza, I Malinović, M Mastrolilli, O Svensson, ...
Discrete Optimization 44, 100567, 2022
Финансирование: Swiss National Science Foundation, US Department of Defense
Legal assignments and fast EADAM with consent via classic theory of stable matchings
Y Faenza, X Zhang
Operations Research 70 (3), 1873-1890, 2022
Финансирование: US National Science Foundation
The power of greedy for online minimum cost matching on the line
E Balkanski, Y Faenza, N Périvier
Proceedings of the 24th ACM Conference on Economics and Computation, 185-205, 2023
Финансирование: US National Science Foundation
New limits of treewidth-based tractability in optimization
Y Faenza, G Muñoz, S Pokutta
Mathematical Programming 191 (2), 559-594, 2022
Финансирование: US National Science Foundation
Discovering Opportunities in New York City’s Discovery Program: Disadvantaged Students in Highly Competitive Markets
Y Faenza, S Gupta, X Zhang
Proceedings of the 24th ACM Conference on Economics and Computation, 2023
Финансирование: US National Science Foundation
Информация о публикациях и финансировании собрана автоматически.