Branch-and-Bound Technique for Solving Optimal Clustering.
Pasi FräntiOlli VirmajokiTimo KaukorantaPublished in: ICPR (2) (2002)
Keyphrases
- branch and bound
- optimal solution
- combinatorial optimization
- implicit enumeration
- integer programming problems
- branch and bound algorithm
- lower bound
- search algorithm
- branch and bound search
- upper bound
- search space
- column generation
- branch and bound method
- bnb adopt
- worst case
- branch and bound procedure
- randomly generated problems
- network design problem
- partial solutions
- dynamic programming
- tree search
- integer program
- search strategies
- lagrangian heuristic
- dna computing
- traveling salesman problem
- evolutionary algorithm
- beam search
- cutting plane
- objective function
- mathematical programming
- metaheuristic
- previously solved
- tree search algorithm