77 citations · 160 across the 8 of their papers we have counts for
11 papers · 1 filter
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…
Scanning integer points with lex-inequalities: A finite cutting plane algorithm for integer programming with linear objective
Michele Conforti, Marianna De Santis, Marco Di Summa +1
We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a lattice basis. To each integer point x in K we associate a family of inequalities…
An extreme function which is nonnegative and discontinuous everywhere
Amitabh Basu, Michele Conforti, Marco Di Summa
We consider Gomory and Johnson's infinite group model with a single row. Valid inequalities for this model are expressed by valid functions and it has been recently shown that any…