M. Conforti

activity

20122022

most citedMaximal lattice-free convex sets in linear subspaces

77 citations · 221 across the 23 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.OC2021

Helly systems and certificates in optimization

Amitabh Basu, Tongtong Chen, Michele Conforti +1

Inspired by branch-and-bound and cutting plane proofs in mixed-integer optimization and proof complexity, we develop a general approach via Hoffman's Helly systems. This helps to d…

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.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…

Helly systems and certificates in optimization

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

Binary extended formulations and sequential convexification

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