Computational results of a semidefinite branch-and-bound algorithm for k-cluster.
Nathan KrislockJérôme MalickFrédéric RoupinPublished in: Comput. Oper. Res. (2016)
Keyphrases
- branch and bound algorithm
- semidefinite
- lower bound
- branch and bound
- upper bound
- semidefinite programming
- optimal solution
- np hard
- higher dimensional
- combinatorial optimization
- worst case
- convex relaxation
- sufficient conditions
- search space
- high dimensional
- text categorization
- data points
- dynamic programming
- special case
- convex sets
- cutting plane
- pairwise
- search algorithm