An Improved Bellman Algorithm for the Kth-shortest Path Problem
Hongyan Shang · Shuxue de shijian yu renshi · 2006
Based on the Bellman algorithm,we make an improvement to get a new algorithm of solving the kth shortest path problem.The advantage of this method is expanding the coverage of Bellman algorithm from solving the shortest path to the kth-shortest path,and taking the minus weight value into account.Furthermore,the new algorithm itself is not far to seek,comparing with the traditional one.