Manuel Aprile

activity

20172026

most citedSmaller extended formulations for spanning tree polytopes in minor-closed classes and beyond

7 citations · 12 across the 12 of their papers we have counts for

collaborators

Showing 2021Show all

4 papers · 1 filter

cs.DM2021

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

Manuel Aprile, Michele Conforti, Yuri Faenza +3

In this paper, we study algorithmic questions concerning products of matrices and their consequences for recognition algorithms for polyhedra. The 1-product of matrices $S_{1}$ , $S_2…

math.CO2021

Extended formulations for matroid polytopes through randomized protocols

Manuel Aprile

Let $P$ be a polytope. The hitting number of $P$ is the smallest size of a hitting set of the facets of $P$ , i.e., a subset of vertices of $P$ such that every facet of $P$ has a ve…

math.CO2021★ 7 cited

Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond

Manuel Aprile, Samuel Fiorini, Tony Huynh +2

Let $G$ be a connected $n$ -vertex graph in a proper minor-closed class $G$ . We prove that the extension complexity of the spanning tree polytope of $G$ is $O (n^{3/2})$ . Th…

math.OC2021

Binary extended formulations and sequential convexification

Manuel Aprile, Michele Conforti, Marco Di Summa

A binarization of a bounded variable $x$ is a linear formulation with variables $x$ and additional binary variables $y_{1}, \dots, y_{k}$ , so that integrality of $x$ is implied by the i…

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

Extended formulations for matroid polytopes through randomized protocols

Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond

Binary extended formulations and sequential convexification

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