Yuri Faenza works on the theory and applications of Optimization. He is primarily interested in the interplay of mathematical programming and computer science, in order to construct and solve mathematical models that support decision making.
In particular, Faenza’s research focuses on Discrete Optimization, including Integer Programming and extensions (for instance, knapsack problems), combinatorial optimization (for instance, matching problems), and polyhedral combinatorics (for instance, extended formulations), and their application to real-world problems such as two-sided markets and multi-period investments planning, among others.
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.
