Performance of convex underestimators in a branch-and-bound framework.
Yannis A. GuzmanM. M. Faruque HasanChristodoulos A. FloudasPublished in: Optim. Lett. (2016)
Keyphrases
- branch and bound
- search algorithm
- lower bound
- branch and bound algorithm
- search space
- optimal solution
- upper bound
- column generation
- bucket elimination
- beam search
- combinatorial optimization
- tree search
- case based reasoning
- simulated annealing
- evolutionary algorithm
- convex optimization
- depth first search
- tree decomposition
- branch and bound procedure