Minimum Cost Routing on Stochastic Networks

DOI10.1287/OPRE.38.3.527MaRDI QIDQ3491293zbMATH OpenOpenAlexFDO

Authors Gehan A. Corea, Vidyadhar G. Kulkarni

Publication date 1990

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

directed networkexponential distributionsMarkov processrandom arc lengths

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Recommendations

• Minimum cost paths over dynamic networks
• Cost Minimization in Networks with Discrete Stochastic Requirements
• Optimal stochastic switching of dynamic routing in networks
• scientific article; zbMATH DE number 786519
• A method to evaluate routing policy through \(p\) minimal paths for stochastic case
• Minimax models for diverse routing
• Finding the shortest path in stochastic networks
• scientific article; zbMATH DE number 4051377
• scientific article; zbMATH DE number 956788
• scientific article; zbMATH DE number 147499

Cited in

(6)

• Finding shortest path in a combined exponential -- gamma probability distribution arc length
• Finding the shortest path in stochastic networks
• Cheapest paths in dynamic networks
• Minimum Cost Blocking Problem in Multi-Path Wireless Routing Protocols
• Short-length routes in low-cost networks via Poisson line patterns
• Polynomial-time identification of robust network flows under uncertain arc failures

This page was built for publication: Minimum Cost Routing on Stochastic Networks

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