The mu vector, Morse inequalities and a generalized lower bound theorem for locally tame combinatorial manifolds.
Bhaskar BagchiPublished in: Eur. J. Comb. (2016)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- euclidean space
- sufficient conditions
- cutting plane
- worst case
- manifold learning
- vector space
- np hard
- optimal solution
- multiscale
- valid inequalities
- von neumann
- moore penrose
- low dimensional
- integer programming
- sample complexity
- high dimensional
- lagrangian relaxation
- riemannian manifolds
- sufficiently accurate
- facet defining