M. Conforti

activity

20122021

most citedMaximal lattice-free convex sets in linear subspaces

77 citations · 160 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2020

Recognizing Cartesian products of matrices and polytopes

Manuel Aprile, Michele Conforti, Yuri Faenza +3

The 1-product of matrices $S_{1} \in R^{m_{1} \times n_{1}}$ and $S_{2} \in R^{m_{2} \times n_{2}}$ is the matrix in $R^{(m_{1} + m_{2}) \times (n_{1} n_{2})}$ whose columns ar…

math.CO2015

Cut dominants and forbidden minors

Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich

The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate some convex combination of proper cuts. Minimizing a nonnegative linear function ov…