Shortest Paths in Probabilistic Graphs
From MaRDI portal
Publication:5568860
DOI10.1287/opre.17.4.583zbMath0176.48301MaRDI QIDQ5568860
No author found.
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.4.583
Related Items
A Monte Carlo Technique with Quasirandom Points for the Stochastic Shortest Path Problem, The use of cutsets in Monte Carlo analysis of stochastic networks, Optimal routing for maximizing the travel time reliability, Optimal paths in probabilistic networks: A case with temporary preferences, The expected length of a shortest path, Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function, Least possible time paths in stochastic, time-varying networks., Optimal control of service rates and arrivals in Jackson networks, Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks, Dynamic shortest path in stochastic dynamic networks: Ship routing problem, Multiobjective routing of hazardous materials in stochastic networks, Reliability function of a class of time-dependent systems with standby redundancy, Finding the shortest path in stochastic networks, Arriving on time, Models and algorithm for stochastic shortest path problem