A Branch-and-Bound Approach for Estimating Covering Functionals of Convex Bodies.
Chan HeYafang LvHorst MartiniSenlin WuPublished in: J. Optim. Theory Appl. (2023)
Keyphrases
- branch and bound
- branch and bound algorithm
- search algorithm
- lower bound
- column generation
- search space
- upper bound
- optimal solution
- combinatorial optimization
- branch and bound procedure
- tree search
- network design problem
- branch and bound method
- special case
- tree search algorithm
- randomly generated problems
- beam search
- convex hull
- lagrangian heuristic
- max sat
- branch and bound search
- depth first search
- convex optimization
- search strategies
- genetic algorithm
- neural network
- mixed integer
- linear programming
- multi agent
- integer programming problems
- bnb adopt
- mini bucket