On computing small variable disjunction branch-and-bound trees.
Max GläserMarc E. PfetschPublished in: Math. Program. (2024)
Keyphrases
- branch and bound
- branch and bound algorithm
- search algorithm
- lower bound
- search space
- upper bound
- optimal solution
- column generation
- combinatorial optimization
- beam search
- randomly generated problems
- search strategies
- tree search
- branch and bound search
- branch and bound method
- branch and bound procedure
- depth first search
- linear programming relaxation
- network design problem
- tree decomposition
- tree search algorithm
- bnb adopt
- partial solutions
- tree structure
- neural network
- mathematical programming
- integer programming problems
- constraint satisfaction problems
- lagrangian heuristic