Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound.
Peiping ShenDianxiao WuKaimin WangPublished in: J. Glob. Optim. (2023)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- upper bound
- search space
- optimal solution
- column generation
- combinatorial optimization
- branch and bound procedure
- branch and bound method
- tree search
- randomly generated problems
- search strategies
- beam search
- tree search algorithm
- depth first search
- lagrangian heuristic
- branch and bound search
- tree decomposition
- network design problem
- max sat
- integer programming problems
- tabu search
- simulated annealing