Technical Note - Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming.
Thomas H. ByersMichael S. WatermanPublished in: Oper. Res. (1984)
Keyphrases
- dynamic programming
- shortest path problem
- dynamic programming algorithms
- optimal solution
- optimal or near optimal
- multiple objectives
- optimal control
- finding optimal
- implicit enumeration
- shortest path
- piecewise linear
- exact solution
- bi objective
- polynomial equations
- knapsack problem
- exhaustive search
- combinatorial optimization problems
- linear programming
- markov decision problems
- stereo matching
- state space
- locally optimal
- lagrange multipliers
- search algorithm
- genetic programming
- combinatorial optimization
- optimal policy
- bayesian networks
- search heuristics
- worst case
- single source
- feasible solution
- markov decision processes