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

DOI10.1016/J.IPL.2006.05.011zbMATH Open1185.68777OpenAlexW2170867633MaRDI QIDQ845830FDOQ845830

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

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

zbMATH Keywords

linear programmingcomputational geometrypolyhedronupper bounds

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
• On the Maximal Number of Facets of 0/1 Polytopes
• Title not available (Why is that?)
• Upper bounds on the maximal number of facets of 0/1-polytopes

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)