Automating branch-and-bound for dynamic programs.
Jakob PuchingerPeter J. StuckeyPublished in: PEPM (2008)
Keyphrases
- branch and bound
- search algorithm
- lower bound
- branch and bound algorithm
- upper bound
- optimal solution
- column generation
- search space
- combinatorial optimization
- tree search
- network design problem
- branch and bound procedure
- search strategies
- integer programming problems
- branch and bound method
- beam search
- depth first search
- tree search algorithm
- cutting plane
- max sat
- partial solutions
- branch and bound search
- randomly generated problems
- heuristic search
- np complete
- objective function
- neural network