Login / Signup
A new dynamic programming approach for finding the shortest path length and the corresponding shortest path in a discrete fuzzy network.
Jung-Yuan Kung
Tzung-Nan Chuang
Chia-Tzu Lin
Published in:
J. Intell. Fuzzy Syst. (2007)
Keyphrases
</>
finding the shortest path
dynamic programming
shortest path
path length
shortest path algorithm
shortest path problem
knapsack problem
minimum length
lagrangian relaxation
road network
spatial networks
routing algorithm
weighted graph
path selection
stereo matching
dijkstra algorithm
state space