Compressed polytopes and statistical disclosure limitation
Compressed polytopes and statistical disclosure limitation
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 …