A branch and bound algorithm for bound constrained optimization problems without derivatives.
Christian JanssonOlaf KnüppelPublished in: J. Glob. Optim. (1995)
Keyphrases
- branch and bound algorithm
- constrained optimization problems
- lower bound
- upper bound
- optimization problems
- constrained optimization
- evolutionary algorithm
- constraint handling
- differential evolution
- branch and bound
- penalty function
- objective function
- np hard
- fitness function
- test problems
- mixed integer linear programming
- worst case
- randomly generated problems
- lower bounding
- global convergence
- optimal solution
- combinatorial optimization
- upper bounding
- precedence constraints
- lower and upper bounds
- lagrangian relaxation
- integer variables
- crossover operator
- variable ordering
- max sat
- single machine scheduling problem
- branch and bound method
- finding an optimal solution
- special case
- genetic programming
- metaheuristic
- simulated annealing
- particle swarm optimization pso
- optimization methods