Yuri Faenza

According to our database, Yuri Faenza authored at least 54 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The simultaneous semi-random model for TSP.

Eric Balkanski, Yuri Faenza, Mathieu Kubik

Math. Program., July, 2024

The total matching polytope of complete bipartite graphs.

Yuri Faenza, Luca Ferrarini

Oper. Res. Lett., 2024

Slack matrices, k-products, and 2-level polytopes.

Manuel Aprile, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia

Discret. Appl. Math., 2024

An Algorithm for the Assignment Game Beyond Additive Valuations.

Eric Balkanski, Christopher En, Yuri Faenza

CoRR, 2024

Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory.

Yuri Faenza, Cliff Stein, Jia Wan

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

Two-Stage Stochastic Stable Matching.

Yuri Faenza, Ayoub Foussoul, Chengyue He

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

Approximation algorithms for the generalized incremental knapsack problem.

Yuri Faenza, Danny Segev, Lingyi Zhang

Math. Program., March, 2023

Affinely representable lattices, stable matchings, and choice functions.

Yuri Faenza, Xuan Zhang

Math. Program., February, 2023

The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits.

Federico D'Onofrio, Yuri Faenza, Lingyi Zhang

CoRR, 2023

Scarf's algorithm and stable marriages.

Yuri Faenza, Chengyue He, Jay Sethuraman

CoRR, 2023

Discovering Opportunities in New York City's Discovery Program: Disadvantaged Students in Highly Competitive Markets.

Yuri Faenza, Swati Gupta, Xuan Zhang

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

The Power of Greedy for Online Minimum Cost Matching on the Line.

Eric Balkanski, Yuri Faenza, Noémie Périvier

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

Understanding Popular Matchings via Stable Matchings.

Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers

SIAM J. Discret. Math., 2022

New limits of treewidth-based tractability in optimization.

Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta

Math. Program., 2022

Quasi-Popular Matchings, Optimality, and Extended Formulations.

Yuri Faenza, Telikepalli Kavitha

Math. Oper. Res., 2022

Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings.

Yuri Faenza, Xuan Zhang

Oper. Res., 2022

On inequalities with bounded coefficients and pitch for the min knapsack polytope.

Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg

Discret. Optim., 2022

Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity.

Yuri Faenza, Clifford Stein, Jia Wan

CoRR, 2022

Discovering Opportunities in New York City's Discovery Program: an Analysis of Affirmative Action Mechanisms.

Yuri Faenza, Swati Gupta, Xuan Zhang

CoRR, 2022

2021

(Un)stable matchings with blocking costs.

Yuri Faenza, Ioannis Mourtos, Michalis Samaris, Jay Sethuraman

Oper. Res. Lett., 2021

Pitch, extension complexity, and covering problems.

Daniel Bienstock, Yuri Faenza, Xuan Zhang

Oper. Res. Lett., 2021

Separation routine and extended formulations for the stable set problem in claw-free graphs.

Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer

Math. Program., 2021

2020

Balas formulation for the union of polytopes is optimal.

Michele Conforti, Marco Di Summa, Yuri Faenza

Math. Program., 2020

Extended formulations from communication protocols in output-efficient time.

Manuel Aprile, Yuri Faenza

Math. Program., 2020

Impact of Bias on School Admissions and Targeted Interventions.

Yuri Faenza, Swati Gupta, Xuan Zhang

CoRR, 2020

Recognizing Cartesian products of matrices and polytopes.

Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia

CoRR, 2020

Reinforcement Learning for Integer Programming: Learning to Cut.

Yunhao Tang, Shipra Agrawal, Yuri Faenza

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Enumeration of 2-level polytopes.

Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich

Math. Program. Comput., 2019

Popular Matchings and Limits to Tractability.

Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

On 2-Level Polytopes Arising in Combinatorial Settings.

Manuel Aprile, Alfonso Cevallos, Yuri Faenza

SIAM J. Discret. Math., 2018

Popularity, stability, and the dominant matching polytope.

Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers

CoRR, 2018

Legal Assignments and fast EADAM with consent via classical theory of stable matchings.

Yuri Faenza, Xuan Zhang

CoRR, 2018

Limits of Treewidth-based tractability in Optimization.

Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta

CoRR, 2018

Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights.

Yuri Faenza, Vladlena Powers, Xingyu Zhang

CoRR, 2018

On Bounded Pitch Inequalities for the Min-Knapsack Polytope.

Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

A PTAS for the Time-Invariant Incremental Knapsack Problem.

Yuri Faenza, Igor Malinovic

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

Improved approximation algorithms and disjunctive relaxations for some knapsack problems.

Yuri Faenza, Igor Malinovic

CoRR, 2017

Extension Complexity of Stable Set Polytopes of Bipartite Graphs.

Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

On Vertices and Facets of Combinatorial 2-Level Polytopes.

Manuel Aprile, Alfonso Cevallos, Yuri Faenza

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Reverse Chvátal-Gomory Rank.

Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe

SIAM J. Discret. Math., 2015

On the existence of compact ε-approximated formulations for knapsack in the original space.

Yuri Faenza, Laura Sanità

Oper. Res. Lett., 2015

Extended formulations, nonnegative factorizations, and randomized communication protocols.

Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary

Math. Program., 2015

Reverse split rank.

Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza

Math. Program., 2015

On largest volume simplices and sub-determinants.

Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition.

Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer

J. ACM, 2014

Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number.

Adrian Bock, Yuri Faenza, Carsten Moldenhauer, Andres J. Ruiz-Vargas

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

On the Convergence of the Affine Hull of the Chvátal-Gomory Closures.

Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza

SIAM J. Discret. Math., 2013

2012

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs.

Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants).

Yuri Faenza, Gianpaolo Oriolo, Claudia Snels

Oper. Res. Lett., 2011

Extended formulations, non-negative factorizations and randomized communication protocols

Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary

CoRR, 2011

A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)

Yuri Faenza, Gianpaolo Oriolo, Claudia Snels

CoRR, 2011

An algorithmic decomposition of claw-free graphs leading to an O(n³)-algorithm for the weighted stable set problem.

Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2009

Extended Formulations for Packing and Partitioning Orbitopes.

Yuri Faenza, Volker Kaibel

Math. Oper. Res., 2009

On coloring problems with local constraints.

Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo

Electron. Notes Discret. Math., 2009