Compressed polytopes and statistical disclosure limitation

Abstract

We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show 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.

arXiv comment14 pages

References in corpus (1)

• Computing the Integer Programming Gap

Cited by in corpus (3)

• Viewing counting polynomials as Hilbert functions via Ehrhart theory
• Groebner Bases for Transportation Polytopes
• A generalization of the integer linear infeasibility problem