Technical Note—A Note on the Stochastic Shortest Route Problem

DOI10.1287/OPRE.33.3.696MaRDI QIDQ3685539zbMATH OpenOpenAlexFDO

Authors Jerzy Kamburowski

Publication date 1985

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

acyclic, stochastic networkoptimality indexshortest route

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Recommendations

• An Analysis of Stochastic Shortest Path Problems
• Variations on the stochastic shortest path problem
• Stochastic shortest path problems with recourse
• scientific article; zbMATH DE number 4079184
• Stochastic shortest paths with recourse
• The stochastic shortest path problem: a polyhedral combinatorics perspective
• A factoring approach for the stochastic shortest path problem
• Publication:4726020
• Finding the shortest path in stochastic networks
• Stochastic Shortest Paths Via Quasi-convex Maximization

Cited in

(4)

• Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
• Dynamic journeying under uncertainty
• Multiobjective routing of hazardous materials in stochastic networks
• Stochastic shortest path with unlimited hops

This page was built for publication: Technical Note—A Note on the Stochastic Shortest Route Problem

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