Shortest Paths in Probabilistic Graphs

H. Frank
Additional contact information
H. Frank: Office of Emergency Preparedness, Executive Office of the President, Washington, D.C.

Operations Research, 1969, vol. 17, issue 4, 583-599

Abstract: This paper considers the problem of finding shortest-path probability distributions in graphs whose branches are weighted with random lengths, examines the consequences of various assumptions concerning the nature of the available statistical information, and gives an exact method for computing the probability distribution, as well as methods based on hypothesis testing and statistical estimation. It presents Monte Carlo results and, based on these results, it develops an efficient method of hypothesis testing. Finally, it discusses briefly the pairwise comparison of paths.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (51)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.4.583 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:17:y:1969:i:4:p:583-599

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().