77 citations · 188 across the 5 of their papers we have counts for
6 papers · 2 filters
Optimal cutting planes from the group relaxations
Amitabh Basu, Michele Conforti, Marco Di Summa +1
We study quantitative criteria for evaluating the strength of valid inequalities for Gomory and Johnson's finite and infinite group models and we describe the valid inequalities th…
Geometric Rescaling Algorithms for Submodular Function Minimization
Daniel Dadush, László A. Végh, Giacomo Zambelli
We present a new class of polynomial-time algorithms for submodular function minimization (SFM), as well as a unified framework to obtain strongly polynomial SFM algorithms. Our al…
Unique lifting of integer variables in minimal inequalities
Amitabh Basu, Manoel Campelo, Michele Conforti +2
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tabl…
A Counterexample to a Conjecture of Gomory and Johnson
Amitabh Basu, Michele Conforti, Gerard Cornuejols +1
In Mathematical Programming 2003, Gomory and Johnson conjecture that the facets of the infinite group problem are always generated by piecewise linear functions. In this paper we g…
Maximal lattice-free convex sets in linear subspaces
Amitabh Basu, Michele Conforti, Gerard Cornuejols +1
We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also…
Minimal inequalities for an infinite relaxation of integer programs
Amitabh Basu, Michele Conforti, Gerard Cornuejols +1
We show that maximal -free convex sets are polyhedra when is the set of integral points in some rational polyhedron of . This result extends a theorem of Lovás…