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

DOI10.1016/j.ipl.2006.05.011zbMath1185.68777OpenAlexW2170867633MaRDI QIDQ845830

Zvi Lotker, Raimund Seidel, Khaled M. Elbassioni

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 programmingupper boundspolyhedroncomputational geometry

Mathematics Subject Classification ID

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

Related Items (1)

Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling

Cites Work

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

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