Shortest Paths in Probabilistic Graphs
From MaRDI portal
Publication:5568860
DOI10.1287/opre.17.4.583zbMath0176.48301OpenAlexW2062568266MaRDI 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 (44)
Optimal path problems with second-order stochastic dominance constraints ⋮ Finding reliable shortest paths in road networks under uncertainty ⋮ Optimal path selection approach for fuzzy reliable shortest path problem ⋮ Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering ⋮ Optimal paths in probabilistic networks: A case with temporary preferences ⋮ Multiobjective routing of hazardous materials in stochastic networks ⋮ Arrival time dependent routing policies in public transport ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ \( \alpha \)-reliable shortest path problem in uncertain time-dependent networks ⋮ Reliability function of a class of time-dependent systems with standby redundancy ⋮ Uncertain programming models for multi-objective shortest path problem with uncertain parameters ⋮ Optimal routing for maximizing the travel time reliability ⋮ Capacity reliability under uncertainty in transportation networks: an optimization framework and stability assessment methodology ⋮ Extreme value distributions for two kinds of path sums of Markov chain ⋮ Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Network reliability: Heading out on the highway ⋮ Least possible time paths in stochastic, time-varying networks. ⋮ New models for shortest path problem with fuzzy arc lengths ⋮ Shortest path problem with uncertain arc lengths ⋮ Shortest path network problems with stochastic arc weights ⋮ Finding the shortest path in stochastic networks ⋮ The global optimal algorithm of reliable path finding problem based on backtracking method ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ INEQUALITIES FOR CORRELATED BIVARIATE NORMAL DISTRIBUTION FUNCTION ⋮ A Monte Carlo Technique with Quasirandom Points for the Stochastic Shortest Path Problem ⋮ Arriving on time ⋮ A new model for path planning with interval data ⋮ Reliability-based user equilibrium in a transport network under the effects of speed limits and supply uncertainty ⋮ The expected length of a shortest path ⋮ Robust Adaptive Routing Under Uncertainty ⋮ Wasserstein distributionally robust shortest path problem ⋮ Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation ⋮ The use of cutsets in Monte Carlo analysis of stochastic networks ⋮ Risk-Averse Shortest Path Interdiction ⋮ Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function ⋮ The most likely path on series-parallel networks ⋮ Uncertain random shortest path problem ⋮ The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks ⋮ Models and algorithm for stochastic shortest path problem ⋮ 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
This page was built for publication: Shortest Paths in Probabilistic Graphs
