77 citations · 160 across the 8 of their papers we have counts for
17 papers
Slack matrices, -products, and -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_2…
Binary extended formulations and sequential convexification
Manuel Aprile, Michele Conforti, Marco Di Summa
A binarization of a bounded variable is a linear formulation with variables and additional binary variables , so that integrality of is implied by the i…
Complexity of branch-and-bound and cutting planes in mixed-integer optimization -- II
Amitabh Basu, Michele Conforti, Marco Di Summa +1
We study the complexity of cutting planes and branching schemes from a theoretical point of view. We give some rigorous underpinnings to the empirically observed phenomenon that co…
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Amitabh Basu, Michele Conforti, Marco Di Summa +1
We investigate the theoretical complexity of branch-and-bound (BB) and cutting plane (CP) algorithms for mixed-integer optimization. In particular, we study the relative efficiency…
Split cuts in the plane
Amitabh Basu, Michele Conforti, Marco Di Summa +1
We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane h…
Recognizing Cartesian products of matrices and polytopes
Manuel Aprile, Michele Conforti, Yuri Faenza +3
The 1-product of matrices and is the matrix in whose columns ar…