A common schema for dynamic programming and branch and bound algorithms.
Paul HelmanPublished in: J. ACM (1989)
Keyphrases
- branch and bound algorithm
- dynamic programming
- lagrangian relaxation
- lower bound
- branch and bound
- randomly generated
- upper bound
- data model
- np hard
- search tree
- combinatorial optimization
- optimal solution
- linear programming
- haplotype inference
- variable ordering
- set covering problem
- boolean satisfiability
- state space
- reinforcement learning
- combinatorial problems
- finding an optimal solution
- single machine
- greedy algorithm
- markov decision processes
- search algorithm
- max sat
- integer programming