Compressed polytopes and statistical disclosure limitation

Simple item page
dc.creatorSullivant, Seth
dc.date2004-12-30
dc.date.accessioned2026-07-07T08:06:38Z
dc.date.available2026-07-07T08:06:38Z
dc.descriptionWe 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.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/math/0412535
dc.identifierhttp://arxiv.org/abs/math/0412535
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130673
dc.subjectCombinatorics
dc.subjectOptimization and Control
dc.subjectStatistics Theory
dc.titleCompressed polytopes and statistical disclosure limitation
dc.typetext

Files

Collections

arXiv