The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

Tohoku Mathematical Journal. Second Series
( Vol. 58 NO.3 / (2006))
Compressed polytopes and statistical disclosure limitation
Seth Sullivant,
Pages. 433-445
Abstract 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.
Contents 1. Introduction
2. Characterization of compressed polytopes
3. Compressed cut polytopes
4. Compressed polytopes in linear optimization
5. Applications in statistical disclosure limitation
Key words Compressed polytope, disclosure limitation, algebraic statistics, integer programming, cut polytope
Mathmatical Subject Classification 52B20, 90C10