A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem.
Gintaras PalubeckisPublished in: INFORMS J. Comput. (1997)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- optimal solution
- column generation
- search space
- upper bound
- clustering algorithm
- beam search
- branch and bound procedure
- combinatorial optimization
- randomly generated problems
- tree search
- branch and bound method
- network design problem
- integer programming problems
- search tree
- branch and bound search
- tree search algorithm
- linear programming relaxation
- search strategies
- metaheuristic
- partial solutions
- genetic algorithm
- convex hull
- special case
- lagrangian heuristic