Technical Note - On Mitten's Axioms for Branch-and-Bound.
A. H. G. Rinnooy KanPublished in: Oper. Res. (1976)
Keyphrases
- branch and bound
- search algorithm
- branch and bound algorithm
- lower bound
- search space
- combinatorial optimization
- upper bound
- optimal solution
- column generation
- knowledge base
- randomly generated problems
- branch and bound method
- tree search
- network design problem
- tree search algorithm
- branch and bound procedure
- max sat
- first order logic
- branch and bound search
- metaheuristic
- beam search
- lagrangian heuristic
- integer programming problems
- search strategies
- depth first search
- lower and upper bounds
- search tree
- graphical models
- mini bucket
- traveling salesman problem