Minimal Inequalities for an Infinite Relaxation of Integer Programs

@article{Basu2010MinimalIF,
  title={Minimal Inequalities for an Infinite Relaxation of Integer Programs},
  author={Amitabh Basu and Michele Conforti and G{\'e}rard Cornu{\'e}jols and Giacomo Zambelli},
  journal={SIAM J. Discrete Math.},
  year={2010},
  volume={24},
  pages={158-168}
}
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of R. This result extends a theorem of Lovász characterizing maximal lattice-free convex sets. Our theorem has implications in integer programming. In particular, we show that maximal S-free convex sets are in one-to-one correspondance with minimal inequalities. 
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Characterization of facets for multiple right-hand side choice linear programs

  • E. L. Johnson
  • Mathematical Programming Study 14
  • 1981
Highly Influential
2 Excerpts

Cutting Planes from Two Rows of a Simplex Tableau

  • K. Andersen, Q. Louveaux, R. Weismantel, L. A. Wolsey
  • Proceedings of IPCO XII, Ithaca, New York
  • 2007
1 Excerpt

A Course in Convexity

  • A. Barvinok
  • Graduate Studies in Mathematics, vol. 54…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…