Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering.
Daniel AloisePierre HansenPublished in: J. Glob. Optim. (2011)
Keyphrases
- branch and bound
- search space
- optimal solution
- objective function
- computational complexity
- worst case
- combinatorial optimization
- space complexity
- bnb adopt
- depth first search
- np hard
- branch and bound algorithm
- tree search
- locally optimal
- branch and bound method
- branch and bound procedure
- mathematical model
- particle swarm optimization
- dynamic programming
- column generation
- linear programming relaxation
- branch and bound search
- cost function