A Variant of the Wang-Foster-Kakade Lower Bound for the Discounted Setting.
Philip AmortilaNan JiangTengyang XiePublished in: CoRR (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- np hard
- markov decision processes
- infinite horizon
- dynamic programming
- optimal solution
- linear programming relaxation
- scheduling problem
- search algorithm
- worst case
- genetic algorithm
- branch and bound method