On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation.
Emily SpeakmanJon LeePublished in: J. Glob. Optim. (2018)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- linear programming relaxation
- search algorithm
- search space
- column generation
- optimal solution
- upper bound
- combinatorial optimization
- branch and bound procedure
- beam search
- tree search algorithm
- branch and bound search
- network design problem
- depth first search
- randomly generated problems
- concept classes
- tree search
- branch and bound method
- integer programming problems
- convex hull
- lagrangian heuristic
- lagrangian relaxation
- partial solutions
- search tree
- search strategies
- bnb adopt
- objective function