Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints.
Yaroslav D. SergeyevDomenico FamularoPaolo PugliesePublished in: J. Glob. Optim. (2001)
Keyphrases
- global optimization
- branch and bound algorithm
- lower bound
- precedence constraints
- branch and bound
- optimal solution
- upper bound
- lower bounding
- np hard
- particle swarm optimization
- combinatorial optimization
- single machine scheduling problem
- randomly generated problems
- integer variables
- pso algorithm
- mixed integer linear programming
- constrained global optimization
- global solution
- image completion
- global search
- constraint satisfaction
- upper bounding
- finding an optimal solution
- neural network
- imperialist competitive algorithm
- max sat
- lagrangian relaxation
- linear programming
- special case
- search algorithm
- global constraints
- constraint programming
- linear program
- genetic algorithm