Lifting properties of maximal lattice-free polyhedra

被引:0
|
作者
Gennadiy Averkov
Amitabh Basu
机构
[1] University of Magdeburg,Institute of Mathematical Optimization, Faculty of Mathematics
[2] The Johns Hopkins University,Department of Applied Mathematics and Statistics
来源
Mathematical Programming | 2015年 / 154卷
关键词
90C10; 90C11; 52C07; 52C22; 52B12;
D O I
暂无
中图分类号
学科分类号
摘要
We study the uniqueness of minimal liftings of cut-generating functions obtained from maximal lattice-free polyhedra. We prove a basic invariance property of unique minimal liftings for general maximal lattice-free polyhedra. This generalizes a previous result by Basu et al. (Math Oper Res 37(2):346–355, 2012) for simplicial maximal lattice-free polytopes, thus completely settling this fundamental question about lifting for maximal lattice-free polyhedra. We further give a very general iterative construction to get maximal lattice-free polyhedra with the unique-lifting property in arbitrary dimensions. This single construction not only obtains all previously known polyhedra with the unique-lifting property, but goes further and vastly expands the known list of such polyhedra. Finally, we extend characterizations from Basu et al. (2012) about lifting with respect to maximal lattice-free simplices to more general polytopes. These nontrivial generalizations rely on a number of results from discrete geometry, including the Venkov-Alexandrov-McMullen theorem on translative tilings and characterizations of zonotopes in terms of central symmetry of their faces.
引用
收藏
页码:81 / 111
页数:30
相关论文
共 50 条
  • [1] Lifting properties of maximal lattice-free polyhedra
    Averkov, Gennadiy
    Basu, Amitabh
    MATHEMATICAL PROGRAMMING, 2015, 154 (1-2) : 81 - 111
  • [2] Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three
    Averkov, Gennadiy
    Wagner, Christian
    Weismantel, Robert
    MATHEMATICS OF OPERATIONS RESEARCH, 2011, 36 (04) : 721 - 742
  • [3] ON LATTICE WIDTH OF LATTICE-FREE POLYHEDRA AND HEIGHT OF HILBERT BASES
    Henk, Martin
    Kuhlmann, Stefan
    Weismantel, Robert
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (03) : 1918 - 1942
  • [4] Constructing Lattice-Free Gradient Polyhedra in Dimension Two
    Paat, Joseph
    Schloter, Miriam
    Speakman, Emily
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2020, 2020, 12125 : 364 - 377
  • [5] Constructing lattice-free gradient polyhedra in dimension two
    Joseph Paat
    Miriam Schlöter
    Emily Speakman
    Mathematical Programming, 2022, 192 : 293 - 317
  • [6] Constructing lattice-free gradient polyhedra in dimension two
    Paat, Joseph
    Schloter, Miriam
    Speakman, Emily
    MATHEMATICAL PROGRAMMING, 2022, 192 (1-2) : 293 - 317
  • [7] Relaxations of mixed integer sets from lattice-free polyhedra
    Del Pia, Alberto
    Weismantel, Robert
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (03): : 221 - 244
  • [8] Relaxations of mixed integer sets from lattice-free polyhedra
    Alberto Del Pia
    Robert Weismantel
    4OR, 2012, 10 : 221 - 244
  • [9] Relaxations of mixed integer sets from lattice-free polyhedra
    Alberto Del Pia
    Robert Weismantel
    Annals of Operations Research, 2016, 240 : 95 - 117
  • [10] Relaxations of mixed integer sets from lattice-free polyhedra
    Del Pia, Alberto
    Weismantel, Robert
    ANNALS OF OPERATIONS RESEARCH, 2016, 240 (01) : 95 - 117