Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds.
Remigijus PaulaviciusJulius ZilinskasAndreas GrotheyPublished in: Optim. Lett. (2010)
Keyphrases
- branch and bound algorithm
- selection strategies
- lower bound
- upper bound
- branch and bound
- selection strategy
- upper bounding
- lower bounding
- search strategies
- optimal solution
- precedence constraints
- lower and upper bounds
- np hard
- single machine scheduling problem
- randomly generated problems
- combinatorial optimization
- branch and bound method
- variable ordering
- finding an optimal solution
- worst case
- max sat
- lagrangian relaxation
- objective function
- mixed integer linear programming
- fitness function
- information retrieval