Feillet, D., Dejax, P., Gendreau, M. and Gueguen, C. (2004) An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to Some Vehicle Routing Problems. Networks, 44, 216-229.
http://onlinelibrary.wiley.com/doi/10.1002/net.20033/abstract
http://dx.doi.org/10.1002/net.20033

has been cited by the following article:

• TITLE: Application of Graph Theory in Grain and Oil Deployment

  AUTHORS: Guangshu Xu, Zilong Song

  KEYWORDS: Short-Path, Min-Cost Max-Flow, Grain and Oil Deployment

  JOURNAL NAME: Journal of Service Science and Management, Vol.8 No.4, August 3, 2015

  ABSTRACT: The deployment of grain and oil is related to the daily needs of people and the stability of society. In this paper, we take the shortest path problem and the minimum cost maximum flow problem in graph theory as the theoretical basis. Through the establishment of distance matrix between the reserves station and the deployment warehouse or between reserve station and reserve station, we use the Floyd algorithm to calculate the shortest path between any two points in the matrix to determine the optimal deployment of the emergency plan. Through the establishment of mathematical model of the reserve station and deployment warehouse, we use the minimum cost maximum flow theory to solve the model and to obtain the deployment programs of grain and oil under normal circumstances. Through the combination of shortest path and minimum cost and maximum flow, we give the deployment plan under the general emergency situation and provide a new way for the deployment of the supply of grain and oil in each case.