Shortest paths in networks with exponentially distributed arc lengths

This publication has 11 references indexed in Scilit:

• A compact hash function for paths in PERT networks
  Operations Research Letters, 1984
• Computing Network Reliability in Time Polynomial in the Number of Cuts
  Operations Research, 1984
• The Stochastic Shortest Route Problem
  Operations Research, 1980
• An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
  Journal of the ACM, 1980
• The use of cutsets in Monte Carlo analysis of stochastic networks
  Mathematics and Computers in Simulation, 1979
• Shortest distance and reliability of probabilistic networks
  Computers & Operations Research, 1976
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
  Networks, 1975
• Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
  Management Science, 1971
• Shortest Paths in Probabilistic Graphs
  Operations Research, 1969
• Distribution of the Time Through a Directed, Acyclic Network
  Operations Research, 1965