Optimal paths in probabilistic networks

DOI10.1023/B:JOTH.0000013560.69722.C1MaRDI QIDQ1776274zbMATH OpenFDO

Authors D. D. M. L. Rasteiro, A. J. B. Anjo

Publication date 23 May 2005

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:JOTH.0000013560.69722.C1

zbMATH Keywords

algorithmsGaussian distributionsrandom graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Stochastic network models in operations research (90B15)

Recommendations

• Optimal paths in probabilistic networks: A case with temporary preferences
• Finding the shortest path in stochastic networks
• scientific article; zbMATH DE number 795219
• Maximal paths in random dynamic graphs
• Réseaux stochastiques

Cited in

(10)

• Optimal paths in probabilistic networks: A case with temporary preferences
• On optimal random nets
• Scalable \epsilon-Optimal Decision-Making and Stochastic Routing in Large Networks via Distributed Supervision of Probabilistic Automata
• Factorizing shortest paths with randomized optimum models
• scientific article; zbMATH DE number 509207 (Why is no real title available?)
• Robust path choice in networks with failures
• scientific article; zbMATH DE number 1783111 (Why is no real title available?)
• scientific article; zbMATH DE number 795219 (Why is no real title available?)
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Optimal Node Visitation in Stochastic Digraphs

This page was built for publication: Optimal paths in probabilistic networks

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