Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems.
Hoang TuyReiner HorstPublished in: Math. Program. (1988)
Keyphrases
- global optimization
- branch and bound algorithm
- optimization problems
- objective function
- combinatorial optimization
- particle swarm optimization
- pso algorithm
- randomly generated
- metaheuristic
- search tree
- optimal solution
- constrained global optimization
- global search
- cost function
- branch and bound
- tabu search
- test problems
- evolutionary algorithm
- global solution
- set covering problem
- search space