An interval branch and bound algorithm for bound constrained optimization problems.
R. Baker KearfottPublished in: J. Glob. Optim. (1992)
Keyphrases
- branch and bound algorithm
- constrained optimization problems
- lower bound
- upper bound
- constrained optimization
- constraint handling
- branch and bound
- optimization problems
- evolutionary algorithm
- differential evolution
- penalty function
- objective function
- test problems
- np hard
- worst case
- fitness function
- global convergence
- randomly generated problems
- lower bounding
- optimal solution
- precedence constraints
- single machine scheduling problem
- combinatorial optimization
- variable ordering
- branch and bound method
- integer variables
- lower and upper bounds
- lagrangian relaxation
- multi objective
- finding an optimal solution
- crossover operator
- mixed integer linear programming
- upper bounding
- genetic algorithm
- linear programming
- optimization algorithm
- similarity search
- genetic algorithm ga
- max sat
- convergence speed