Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three

References

• Andersen K, Wagner C, Weismantel R (2009) On an analysis of the strength of mixed-integer cutting planes from multiple simplex tableau rows. SIAM J. Optim. 20(2):967–982.Crossref, Google Scholar
• Andersen K, Louveaux Q, Weismantel R, Wolsey LA (2007) Inequalities from two rows of a simplex tableau. Integer Programming and Combinatorial Optimization. Lecture Notes in Comput. Sci., Vol. 4513 (Springer, Berlin), 1–15.Crossref, Google Scholar
• Averkov G (2013) A proof of Lovász’s theorem on maximal lattice-free sets. Beitr. Algebra Geom. 54(1):105–109.Crossref, Google Scholar
• Averkov G, Wagner C (2012) Inequalities for the lattice width of lattice-free convex sets in the plane. Beitr. Algebra Geom. 53(1):1–23.Crossref, Google Scholar
• Averkov G, Wagner C, Weismantel R (2011) Maximal lattice-free polyhedra: Finiteness and an explicit description in dimension three. Math. Oper. Res. 36(4):721–742.Link, Google Scholar
• Barvinok A (2002) A Course in Convexity. Graduate Studies in Mathematics, Vol. 54 (American Mathematical Society, Providence, RI).Crossref, Google Scholar
• Basu A, Bonami P, Cornuéjols G, Margot F (2011) On the relative strength of split, triangle and quadrilateral cuts. Math. Programming 126(2):281–314.Crossref, Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2011) Corner polyhedron and intersection cuts. Surveys Oper. Res. Management Sci. 16(2):105–120.Crossref, Google Scholar
• Cook W, Kannan R, Schrijver A (1990) Chvátal closures for mixed integer programming problems. Math. Programming 47(2):155–174.Crossref, Google Scholar
• Del Pia A (2012) On the rank of disjunctive cuts. Math. Oper. Res. 37(2):372–378.Link, Google Scholar
• Del Pia A, Weismantel R (2012) On convergence in mixed integer programming. Math. Programming 135(1–2):397–412.Crossref, Google Scholar
• Dey SS, Wolsey LA (2010) Two row mixed-integer cuts via lifting. Math. Programming 124(1):143–174.Crossref, Google Scholar
• Gruber PM (1993) Geometry of numbers. Gruber PM, Wills JM, eds. Handbook of Convex Geometry Vol. B (North-Holland, Amsterdam), 739–763.Crossref, Google Scholar
• Gruber PM, Lekkerkerker CG (1987) Geometry of Numbers. North-Holland Mathematical Library, 2nd ed., Vol. 37 (North-Holland, Amsterdam).Google Scholar
• Hurkens CAJ (1990) Blowing up convex sets in the plane. Linear Algebra Appl. 134:121–128.Crossref, Google Scholar
• Kannan R, Lovász L (1988) Covering minima and lattice-point-free convex bodies. Ann. of Math. 128(3):577–602.Crossref, Google Scholar
• Lovász L (1989) Geometry of numbers and integer programming. Iri M, Tanabe K, eds. Mathematical Programming: Recent Developments and Applications. Mathematics and Its Applications (Japanese Series), Vol. 6 (Kluwer, Dordrecht, Netherlands), 177–201.Google Scholar
• Nill B, Ziegler GM (2011) Projecting lattice polytopes without interior lattice points. Math. Oper. Res. 36(3):462–467.Link, Google Scholar
• Rabinowitz S (1989) A census of convex lattice polygons with at most one interior lattice point. Ars Combin. 28:83–96.Google Scholar
• Rockafellar RT (1997) Convex Analysis. Princeton Landmarks in Mathematics (Princeton University Press, Princeton, NJ).Google Scholar
• Rogers CA, Shephard GC (1957) The difference body of a convex body. Arch. Math. (Basel) 8:220–233.Crossref, Google Scholar
• Scarf HE (1985) Integral polyhedra in three space. Math. Oper. Res. 10(3):403–438.Link, Google Scholar
• Schneider R (2014) Convex Bodies: The Brunn-Minkowski Theory. Encyclopedia of Mathematics and its Applications (No. 151), 2nd ed. (Cambridge University Press, Cambridge, UK).Google Scholar
• Schrijver A (1986) Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics (John Wiley & Sons, Chichester, UK).Google Scholar
• Treutlein J (2008) 3-dimensional lattice polytopes without interior lattice points. Preprint arXiv: 0809.1787.Google Scholar
• Treutlein J (2010) Birationale Eigenschaften generischer Hyperflächen in algebraischen Tori. Ph.D. thesis, Universität Tübingen, Tübingen, Germany.Google Scholar
• Wagner C (2011) Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting-Plane Theory. Ph.D. thesis, ETH Zürich, Zürich, Switzerland.Google Scholar