The Stochastic Shortest Route Problem

DOI10.1287/OPRE.28.5.1122MaRDI QIDQ3898344zbMATH OpenOpenAlexFDO

Authors C. E. Sigal, J. J. Solberg, A. Alan B. Pritsker

Publication date 1980

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.28.5.1122

zbMATH Keywords

directed acyclic networkpath optimality indexperformance measurestochastic networkstochastic shortest route problemuniformly directed cutsets

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Stochastic programming (90C15) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Cited in

(22)

• Fuzzy sets and statistical data
• Probabilistic shortest path problems with budgetary constraints
• 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.
• Dynamic journeying under uncertainty
• Multiobjective routing of hazardous materials in stochastic networks
• Arriving on time
• Models and algorithm for stochastic shortest path problem
• A fully polynomial time approximation scheme for the probability maximizing shortest path problem
• The most likely path on series-parallel networks
• PH-graphs for analyzing shortest path problems with correlated traveling times
• Exact cuts in networks
• Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
• Maximizing expected utility for stochastic combinatorial optimization problems
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• A Monte Carlo Technique with Quasirandom Points for the Stochastic Shortest Path Problem
• The use of cutsets in Monte Carlo analysis of stochastic networks
• Uncertain random shortest path problem
• A compact hash function for paths in PERT networks
• Optimal routing for maximizing the travel time reliability

This page was built for publication: The Stochastic Shortest Route Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898344)