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.
Citation
Seth Sullivant. "Compressed polytopes and statistical disclosure limitation." Tohoku Math. J. (2) 58 (3) 433 - 445, 2006. https://doi.org/10.2748/tmj/1163775139
Information
