Yuri Faenza


334 S.W. Mudd

Tel(212) 854-4703

The goal of all of Yuri Faenza’s research is to apply theory to real-world problems. He is primarily interested in the interplay of mathematical programming, which uses mathematical models to aid in decision-making, and theoretical computer science. A proponent of interdisciplinary research, he is eager to apply his techniques to problems being studied by colleagues from other departments.

Research Interests

Mathematical Programming, Combinatorial Optimization, Polyhedral Combinatronics

In particular, Faenza’s research focuses on discrete optimization, including integer programming and extensions (e.g., knapsack problems), combinatorial optimization (e.g., matching problems), and polyhedral combinatorics (e.g., extended formulations).

Faenza received a BSc in management science and engineering, summa cum laude, in 2004 and an MSc in mathematical engineering, summa cum laude, in 2006 from the Università di Roma Tor Vergata, Italy. He received a PhD in operations research from the Sapienza University of Rome, Italy, in 2010. He was a Swiss National Science Foundation Ambizione Fellow at the École Polytechnique Fédérale de Lausanne (EPFL), Switzerland, 2015–2016, and has been a postdoctoral researcher at the University of Brussels, Belgium, 2014; at EPFL, Switzerland, 2012–2014; and at the University of Padua, Italy, 2010–2012.


  • Visiting Researcher, HIM, Germany, 2015
  • Postdoctoral Researcher, Mathematics, ULB, Belgium, 2014
  • Postdoctoral Researcher, DISOPT group, EPFL, Switzerland, 2012–2014
  • Postdoctoral Researcher, Mathematics, University of Padua, Italy, 2010–2012
  • Visiting Researcher, Combinatorics and Optimization, University of Waterloo, Canada, 2010
  • Visiting Researcher, Discrete Optimization group, ZIB, Germany, 2006 


  • Assistant Professor, Industrial Engineering and Operations Research, Columbia University, 2016–
  • SNSF Ambizione Fellow, DISOPT group, EPFL, Switzerland, 2015 – 2016


  • Gift by the Swiss National Science Foundation, 2017
  • Swiss National Science Foundation Ambizione Grant, 2014


  • Lorenzo Brunetta award for a PhD thesis in Operations Research, 2012


  • M. Conforti, A. Del Pia, M. Di Summa, and Y. Faenza: Reverse Split Rank. Mathematical Programming B, 154-1 (2015), pp. 273–303
  • Y. Faenza, S. Fiorini, R. Grappe, and H.R. Tiwary: Extended formulations, non-negative factorizations, and randomized communication protocols, Mathematical Programming B, 153-1 (2015), pp. 75–94
  • A. Bohn, Y. Faenza, S. Fiorini, V. Fisikopoulos, M. Macchia, and K. Pashkovich: Enumeration of 2-level polytopes. Proceedings of the Twenty-Third European Symposium on Algorithms (ESA 2015), pp. 191-202
  • Y. Faenza, G. Oriolo, and G. Stauffer: Solving the weighted stable set problem in claw-free graphs via decomposition, Journal of the ACM, 61-4 (2014): 2
  • Y. Faenza, G. Oriolo, and G. Stauffer: Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), January 2012, pp. 1298-1308
  • Y. Faenza, G. Oriolo, and G. Stauffer: An algorithmic decomposition of claw-free graphs leading to an O(n^3)-algorithm for the weighted stable set problem, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), January 2011, pp. 630-646.
  • Y. Faenza and V. Kaibel: Extended Formulations for Packing and Partitioning Orbitopes, Mathematics of Operations Research Vol. 34, No. 3 (2009), pp. 686-697