Unique Minimal Liftings for Simplicial Polytopes

Published Online:https://doi.org/10.1287/moor.1110.0536

References

  • Barvinok A.A Course in Convexity, Graduate Studies in Mathematics (2002) 54(American Mathematical Society, Providence, RI) Google Scholar
  • Basu A., Cornuéjols G., Margot F. Intersection cuts with infinite split rank. Math. Oper. Res. (2012) 37(1):21–40LinkGoogle Scholar
  • Basu A., Conforti M., Cornuéjols G., Zambelli G. Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. (2010) 35(3):704–720LinkGoogle Scholar
  • Basu A., Campelo M., Conforti M., Cornuéjols G., Zambelli G. On lifting integer variables in minimal inequalities. IPCO 2010 (2010) 6080(Lausanne, Switzerland)85–95Lecture Notes in Comput. Sci.CrossrefGoogle Scholar
  • Basu A., Campelo M., Conforti M., Cornuéjols G., Zambelli G. Unique liftings of integer variables in minimal inequalities. (2011) . Manuscript available at http://www.math.ucdavis.edu/~abasuGoogle Scholar
  • Borozan V., Cornuéjols G. Minimal valid inequalities for integer constraints. Math. Oper. Res. (2009) 34(3):538–546LinkGoogle Scholar
  • Conforti M., Cornuéjols G., Zambelli G. A geometric perspective on lifting. Oper. Res. (2011) 59(3):569–577LinkGoogle Scholar
  • Dey S. S., Wolsey L. A. Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. IPCO 2008 (2008) 5035(Bertinoro, Italy)463–475Lecture Notes in Comput. Sci.CrossrefGoogle Scholar
  • Gruber P. M., Lekkerkerker C. G.Geometry of Numbers (1987) 2nd ed.(North-Holland Mathematical Library, Elsevier, Amsterdam) Google Scholar
  • Lovász L., Iri M., Tanabe K. Geometry of numbers and integer programming. Mathematical Programming: Recent Developments and Applications (1989) (Kluwer Academic Publishers, Amsterdam) 177–210Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.