A decomposition of 2-weak vertex-packing polytopes

DOI10.1007/BF02574393zbMath0813.52009OpenAlexW2115110298MaRDI QIDQ1338460

Einar Steingrímsson

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

zbMATH Keywords

linear programming\(h\)-vectorsimplicial complexvolume computationEhrhart polynomials2-weak vertex-packing polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Linear programming (90C05)

Related Items

Gaining or losing perspective ⋮ A decomposition of 2-weak vertex-packing polytopes ⋮ Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations ⋮ Experimental validation of volume-based comparison for double-McCormick relaxations ⋮ Ehrhart series of fractional stable set polytopes of finite graphs ⋮ Volume computation for sparse Boolean quadric relaxations

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