Person
Yuri Faenza
This person is no longer with EPFL
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications (12)
Please note that this is not a complete list of this person’s publications. It includes only semantically relevant works. For a full list, please refer to Infoscience.
Extended Formulations from Communication Protocols in Output-Efficient Time
Yuri Faenza, Manuel Francesco Aprile
Deterministic protocols are well-known tools to obtain extended formulations, with many applications to polytopes arising in combinatorial optimization. Although constructive, those tools are not output-efficient, since the time needed to produce the exten ...
SPRINGER INTERNATIONAL PUBLISHING AG2019On 2-Level Polytopes Arising In Combinatorial Settings
Yuri Faenza, Manuel Francesco Aprile, Alfonso Bolívar Cevallos Manzano
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level polytopes arisi ...
SIAM PUBLICATIONS2018Extension complexity of stable set polytopes of bipartite graphs
Yuri Faenza, Manuel Francesco Aprile
The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...
Springer2017