Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices
| dc.creator | Elbassioni, Khaled | |
| dc.creator | Lotker, Zvi | |
| dc.creator | Seidel, Raimund | |
| dc.date | 2005-07-14 | |
| dc.date.accessioned | 2026-07-07T03:23:13Z | |
| dc.date.available | 2026-07-07T03:23:13Z | |
| dc.description | 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!$. | |
| dc.description | 3 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0507038 | |
| dc.identifier | http://arxiv.org/abs/cs/0507038 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32861 | |
| dc.subject | Computational Geometry | |
| dc.subject | G.1.6 | |
| dc.title | Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices | |
| dc.type | text |