Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Minimum cost-reliability ratio path problem
Computers and Operations Research
Lower bounds on two-terminal network reliability
Discrete Applied Mathematics
Computers and Operations Research
An algorithm for finding the k quickest paths in a network
Computers and Operations Research
Information Processing Letters
The all-pairs quickest path problem
Information Processing Letters
Finding the k quickest simple paths in a network
Information Processing Letters
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Computers and Operations Research
Minimum time paths in a network with mixed time constraints
Computers and Operations Research
A heuristic technique for generating minimal path and cutsets of a general network
Computers and Industrial Engineering
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Computers and Operations Research
A label-setting algorithm for finding a quickest path
Computers and Operations Research
An algorithm for ranking quickest simple paths
Computers and Operations Research
Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Computers & Mathematics with Applications
Hi-index | 0.09 |
This paper extends the quickest path problem to a stochastic flow network in which the capacity of each arc is variable. We mainly evaluate the system reliability that d units of data can be sent from the source to the sink under both time threshold T and budget B. In particular, the data are transmitted through multiple disjoint minimal paths simultaneously in order to reduce the transmission time. A simple algorithm is proposed to generate all lower boundary points for (d,T,B), and the system reliability can then be computed in terms of such points by utilizing a union of subsets. Computational complexity in both worst case and average cases show that the proposed algorithm can be executed efficiently.