first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
Determination of shortest path in a network with time-dependent edge-lengths *
Author:
Emil Klafszky a
| Affiliation: | a Computing Center of Hungaria Academy of Sciences, Budapest, I |
DOI:
10.1080/02331887208801081
Publication Frequency:
6 issues per year
Subjects:
Mathematical Statistics;
Statistical Theory & Methods;
Statistics;
Statistics for the Biological Sciences;
Stochastic Models & Processes;
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
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.
|
|
*
1This paper is the English version of the paper[5].
|
| view references (5) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
