On interval branch-and-bound for additively separable functions with common variables.
José L. BerenguelLeocadio G. CasadoInmaculada GarcíaEligius M. T. HendrixFrédéric MessinePublished in: J. Glob. Optim. (2013)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- upper bound
- column generation
- search space
- optimal solution
- combinatorial optimization
- branch and bound method
- branch and bound procedure
- tree search
- additively separable
- randomly generated problems
- lagrangian heuristic
- network design problem
- tree search algorithm
- branch and bound search
- graphical models
- np hard
- satisfiability problem
- neural network
- max sat
- linear programming relaxation