Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices

Details Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices

2005-07-14

arxiv.org/abs/cs/0507038v1

Computer Science

Computational Geometry

3 pages

Scientific paper

In this note we show that the maximum number of vertices in any polyhedron
$P=\{x\in \mathbb{R}^d : Ax\leq b\}$ with $0,1$-constraint matrix $A$ and a
real vector $b$ is at most $d!$.

Affiliated with

Also associated with

No associations

Rating

Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-575025