Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Seth Sullivant (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: