Abstract
The solution of the shortest path problem in case of time-independent edge-lengths is due to FORD and FULKERSON [1,2]. By using the method of dynamic programming, BELLMAN [3] gave a procedure for the determination of the length of the shortest path. Following this principle COOKE and HALSEY [4] have a procedure for the determination of the length of the shortest path in case of time-dependent edge-lengths. This procedure, however, gives only the length of the path, not the path itself. We shall demonstrate in this paper that the method of FORD and FULKERSON leads itself too to solution of the problem, morcover it gives also the shortest path.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
