4 papers
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…
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…
Balas formulation for the union of polytopes is optimal
Michele Conforti, Marco Di Summa, Yuri Faenza
A celebrated theorem of Balas gives a linear mixed-integer formulation for the union of two nonempty polytopes whose relaxation gives the convex hull of this union. The number of i…