Optimal paths in graphs with stochastic or multidimensional weights
- 1 September 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (9), 670-676
- https://doi.org/10.1145/358172.358406
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Stochastic Shortest Route ProblemOperations Research, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Shortest distance and reliability of probabilistic networksComputers & Operations Research, 1976
- Risk-Sensitive Markov Decision ProcessesManagement Science, 1972
- Shortest Paths in Probabilistic GraphsOperations Research, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Risk Aversion in the Small and in the LargeEconometrica, 1964
- A note on two problems in connexion with graphsNumerische Mathematik, 1959