Improving the filtering of Branch-And-Bound MDD solver (extended).
Xavier GillardVianney CoppéPierre SchausAndré Augusto CiréPublished in: CoRR (2021)
Keyphrases
- branch and bound
- tree search
- lower bound
- branch and bound algorithm
- search algorithm
- upper bound
- optimal solution
- search space
- column generation
- combinatorial optimization
- branch and bound procedure
- randomly generated problems
- branch and bound method
- linear programming relaxation
- network design problem
- tree search algorithm
- beam search
- partial solutions
- max sat
- depth first search
- integer programming problems
- search strategies
- lagrangian heuristic
- tabu search
- iterative deepening
- path finding
- search tree
- metaheuristic