Parallel branch and bound for global optimization with combination of Lipschitz bounds.
Remigijus PaulaviciusJulius ZilinskasAndreas GrotheyPublished in: Optim. Methods Softw. (2011)
Keyphrases
- global optimization
- branch and bound
- lower bound
- upper bound
- branch and bound search
- search algorithm
- depth first search
- branch and bound algorithm
- column generation
- particle swarm optimization
- optimal solution
- search space
- combinatorial optimization
- lower and upper bounds
- branch and bound procedure
- tree search
- pso algorithm
- randomly generated problems
- beam search
- global solution
- worst case
- constrained global optimization
- network design problem
- shared memory
- lagrangian relaxation
- branch and bound method
- tree search algorithm
- bnb adopt
- lagrangian heuristic
- deterministic annealing
- np hard