A Modified Branch-and-Bound Strategy.
Donald T. TangC. K. WongPublished in: Inf. Process. Lett. (1973)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- search space
- search strategies
- optimal solution
- column generation
- upper bound
- combinatorial optimization
- beam search
- search strategy
- tree search
- randomly generated problems
- branch and bound search
- branch and bound procedure
- max sat
- tree decomposition
- branch and bound method
- integer programming problems
- heuristic search
- depth first search
- lagrangian heuristic
- tabu search
- neural network
- traveling salesman problem
- linear programming relaxation