A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices.
Marcelo RisJunior BarreraPublished in: ISMM (2) (2007)
Keyphrases
- optimization algorithm
- branch and bound
- cost function
- multi objective
- lower bound
- search algorithm
- branch and bound algorithm
- optimal solution
- objective function
- combinatorial optimization
- search space
- upper bound
- column generation
- optimization method
- particle swarm optimization pso
- boolean functions
- differential evolution
- tree search
- evolutionary multi objective
- branch and bound method
- optimization problems
- network design problem
- max sat
- beam search
- optimization strategy
- randomly generated problems
- artificial bee colony
- branch and bound procedure
- hybrid optimization algorithm
- partial solutions
- control parameters
- neural network
- tree search algorithm
- combinatorial optimization problems
- metaheuristic
- branch and bound search
- scheduling problem
- particle swarm optimization