Shortest paths in networks with exponentially distributed arc lengths-Reference-Cited by-同舟云学术

Shortest paths in networks with exponentially distributed arc lengths

Published:1986 Issue:3 Volume:16 Page:255-274
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Kulkarni V. G.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference15 articles.

1. and . An improved conditional Monte Carlo technique for the stochastic shortest route problem. Technical Report No. 84–9, Curriculum in Operations Research and Systems Analysis, University of North Carolina, Chapel Hill, N. C. 27514 (1984).

2. Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis

3. Shortest-path algorithms: Taxonomy and annotation

4. Estimating critical path and arc probabilities in stochastic activity networks. TR-83/5, Curriculum in Operations Research and Systems Analysis, University of North Carolina, Chapel Hill, N. C. 27514 (1983).

5. Shortest Paths in Probabilistic Graphs

Cited by 51 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Conditional Importance Sampling For Convex Rare-Event Sets;2023 Winter Simulation Conference (WSC);2023-12-10

2. Mean Value Analysis of Critical Attack Paths with Multiple Parameters;Secure IT Systems;2023-11-08

3. Shortest path network problems with stochastic arc weights;Optimization Letters;2021-04-20

4. A shortest path problem in a stochastic network with exponential travel time;International Journal of Applied Management Science;2021

5. Strategies to Utilize the Positive Emotional Contagion Optimally in Crowd Evacuation;IEEE Transactions on Affective Computing;2020-10-01