Compressed polytopes and statistical disclosure limitation
Sullivant, Seth
Tohoku Math. J. (2), Tome 58 (2006) no. 1, p. 433-445 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and prove that every compressed lattice polytope is affinely isomorphic to a 0/1-polytope. As an application, we characterize those graphs whose cut polytopes are compressed and discuss consequences for studying linear programming relaxations in statistical disclosure limitation.
Publié le : 2006-09-14
Classification:  Compressed polytope,  disclosure limitation,  algebraic statistics,  integer programming,  cut polytope,  52B20,  90C10 
@article{1163775139,
     author = {Sullivant, Seth},
     title = {Compressed polytopes and statistical disclosure limitation},
     journal = {Tohoku Math. J. (2)},
     volume = {58},
     number = {1},
     year = {2006},
     pages = { 433-445},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1163775139}
}

Sullivant, Seth. Compressed polytopes and statistical disclosure limitation. Tohoku Math. J. (2), Tome 58 (2006) no. 1, pp.  433-445. http://gdmltest.u-ga.fr/item/1163775139/