On derivative based bounding for simplicial branch and bound.
Eligius M. T. HendrixBoglárka G.-TóthFrédéric MessineLeocadio G. CasadoPublished in: RAIRO Oper. Res. (2021)
Keyphrases
- branch and bound
- upper bound
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- beam search
- branch and bound method
- branch and bound procedure
- optimal solution
- search space
- tree search
- combinatorial optimization
- network design problem
- tree search algorithm
- randomly generated problems
- lagrangian heuristic
- lower and upper bounds
- search strategies
- linear programming relaxation
- tree decomposition
- max sat
- integer programming problems
- np hard
- depth first search
- branch and bound search
- bayesian networks