Towards ultra-scale Branch-and-Bound using a high-productivity language.
Tiago CarneiroJan GmysNouredine MelabDaniel TuyttensPublished in: Future Gener. Comput. Syst. (2020)
Keyphrases
- branch and bound
- branch and bound algorithm
- lower bound
- search algorithm
- search space
- optimal solution
- column generation
- beam search
- upper bound
- combinatorial optimization
- tree search
- branch and bound procedure
- branch and bound method
- branch and bound search
- linear programming relaxation
- tree search algorithm
- search strategies
- network design problem
- lagrangian heuristic
- depth first search
- max sat
- partial solutions
- special case
- graphical models
- integer programming problems
- genetic algorithm