Inequalities for the lattice width of lattice-free convex sets in the plane-Reference-Cited by-同舟云学术

Inequalities for the lattice width of lattice-free convex sets in the plane

Published:2011-07-01 Issue:1 Volume:53 Page:1-23
ISSN:0138-4821
Container-title:Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry
language:en
Short-container-title:Beitr Algebra Geom

Author:

Averkov Gennadiy,Wagner Christian

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology,Algebra and Number Theory

Link

http://link.springer.com/content/pdf/10.1007/s13366-011-0028-8.pdf

Reference20 articles.

1. Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three (2010). http://arxiv.org/abs/1010.1077

2. Basu A., Conforti M., Cornuéjols G., Zambelli G.: Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35(3), 704–720 (2010)

3. Betke U., Henk M., Wills J.M.: Successive-minima-type inequalities. Discr. Comput. Geom. 9(2), 165–175 (1993) MR 93j:52026

4. Coxeter H.S.M.: Introduction to Geometry. Wiley Classics Library, Wiley, New York (1989) (Reprint of the 1969 edition MR 90a:51001)

5. Dey S.S., Wolsey L.A.: Two row mixed integer cuts via lifting, Technical Report CORE DP 30. Université catholique de Louvain, Louvain-la-Neuve, Belgium (2008)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing the Covering Radius of a Polytope with an Application to Lonely Runners;Combinatorica;2022-02-18

2. A local maximizer for lattice width of 3-dimensional hollow bodies;Discrete Applied Mathematics;2021-07

3. The complete classification of empty lattice 4-simplices;Revista Matemática Iberoamericana;2021-03-16

4. Complexity of linear relaxations in integer programming;Mathematical Programming;2021-02-18

5. Hollow polytopes of large width;Proceedings of the American Mathematical Society;2019-08-07