Mathematics – Combinatorics
Scientific paper
2004-12-30
Mathematics
Combinatorics
14 pages
Scientific paper
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.
No associations
LandOfFree
Compressed polytopes and statistical disclosure limitation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Compressed polytopes and statistical disclosure limitation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed polytopes and statistical disclosure limitation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-45706