The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices.
Guillermo Pineda-VillavicencioDavid T. YostPublished in: SIAM J. Discret. Math. (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- worst case
- convex hull
- optimal solution
- valid inequalities
- von neumann
- lattice points
- polynomial approximation
- lower bounding
- objective function
- packing problem
- weighted graph
- lagrangian relaxation
- cutting plane
- edge weights
- online algorithms
- vc dimension
- competitive ratio
- constant factor