A decomposition of 2-weak vertex-packing polytopes
From MaRDI portal
Publication:1338460
DOI10.1007/BF02574393zbMath0813.52009MaRDI QIDQ1338460
Publication date: 29 May 1995
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131343
linear programming; \(h\)-vector; simplicial complex; volume computation; Ehrhart polynomials; 2-weak vertex-packing polytope
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
90C05: Linear programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattice points in lattice polytopes
- Two poset polytopes
- Permutation statistics of indexed permutations
- Signed permutation statistics
- A decomposition of 2-weak vertex-packing polytopes
- On certain polytopes associated with graphs
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Decompositions of Rational Convex Polytopes
- On the facial structure of set packing polyhedra
- The maximum numbers of faces of a convex polytope