A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Inverse Shortest Path in a Graph with Rough Edge Weights
2016
International Journal of Computer Applications
The inverse shortest path problem occurs mostly in reconstruction type of problems where, minimum modifications of the edge weights of a network are made to make a predetermined path to be shortest. In this paper, initially the edge weights are taken as rough variables which, are based on the subjective estimation of the experts. Then these rough weights are approximated by normal uncertain variables and an uncertain programming model has been developed. Further, the uncertain programming model
doi:10.5120/ijca2016911143
fatcat:acpms3gi5zae5etl3s7oovqvsu