Branch-and-Bound Strategies for Dynamic Programming.
Thomas L. MorinRoy E. MarstenPublished in: Oper. Res. (1976)
Keyphrases
- branch and bound
- dynamic programming
- lower bound
- branch and bound algorithm
- search strategies
- search algorithm
- column generation
- optimal solution
- search space
- upper bound
- combinatorial optimization
- randomly generated problems
- branch and bound procedure
- tree search algorithm
- tree search
- beam search
- network design problem
- branch and bound method
- lagrangian relaxation
- linear programming
- branch and bound search
- integer programming problems
- lagrangian heuristic
- depth first search
- heuristic search
- reinforcement learning
- max sat
- path finding
- partial solutions
- infinite horizon
- cost function
- evolutionary algorithm
- neural network