Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices

DOI10.1016/J.IPL.2006.05.011MaRDI QIDQ845830zbMATH OpenOpenAlexFDO

Authors Khaled Elbassioni, Zvi Lotker, Raimund Seidel

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.05.011

zbMATH Keywords

linear programmingcomputational geometrypolyhedronupper bounds

Mathematics Subject Classification ID

Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A bound for the number of vertices of a polytope with applications
• Upper bounds on the maximal number of facets of 0/1-polytopes
• Bounds on the number of vertices of perturbed polyhedra
• Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• An upper bound theorem concerning lattice polytopes
• An Upper Bound Theorem for Polytope Pairs
• scientific article; zbMATH DE number 6008341
• Lower bound for the maximal number of facets of a 0/1 polytope
• scientific article; zbMATH DE number 1187141

Cites work

• Convex Polytopes
• Lectures on Polytopes
• Spline Notation Applied to a Volume Problem
• Upper bounds on the maximal number of facets of 0/1-polytopes

Cited in

(5)

• scientific article; zbMATH DE number 6008341 (Why is no real title available?)
• scientific article; zbMATH DE number 1187141 (Why is no real title available?)
• On the Maximal Number of Facets of 0/1 Polytopes
• Upper bounds on the maximal number of facets of 0/1-polytopes
• Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling

This page was built for publication: Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845830)