77 citations · 135 across the 2 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2026
On finding exact solutions of linear programs in the oracle model
Daniel Dadush, László A. Végh, Giacomo Zambelli
We consider linear programming in the oracle model: , where the polyhedron is given by a separation oracle. We…
math.OC2017★ 77 cited
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…
math.OC2017★ 58 cited
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…