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
Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths
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
A heuristic technique for generating minimal path and cutsets of a general network
Computers and Industrial Engineering
An algorithm for the quickest path problem
Operations Research Letters
A label-setting algorithm for finding a quickest path
Computers and Operations Research
Reliable and economic resource allocation in an unreliable flow network
Computers and Operations Research
Routing policy of stochastic-flow networks under time threshold and budget constraint
Expert Systems with Applications: An International Journal
Time version of the shortest path problem in a stochastic-flow network
Journal of Computational and Applied Mathematics
Optimal routing policy of a stochastic-flow network
Computers and Industrial Engineering
Optimal pair of minimal paths under both time and budget constraints
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A simple universal generating function method to search for all minimal paths in networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Applying Lagrangian relaxation-based algorithms for airline coordinated flight scheduling problems
Computers and Industrial Engineering
A method to evaluate routing policy through p minimal paths for stochastic case
Information Sciences: an International Journal
System reliability for quickest path problems under time threshold and budget
Computers & Mathematics with Applications
Stochastic flow networks via multiple paths under time threshold and budget constraint
Computers & Mathematics with Applications
A method to evaluate the routing policy with two minimal paths within time threshold
Expert Systems with Applications: An International Journal
Reliable and restricted quickest path problems
INOC'11 Proceedings of the 5th international conference on Network optimization
Transmission reliability of k minimal paths within time threshold
Computers and Industrial Engineering
On performance evaluation for a multistate network under spare routing
Information Sciences: an International Journal
Min-Max quickest path problems
Networks
| Hi-index | 0.01 |
From the point of view of quality management, it is an important issue to reduce the transmission time in the network. The quickest path problem is to find the path in the network to send a given amount of data from the source to the sink such that the transmission time is minimized. Traditionally, this problem assumed that the capacity of each arc in the network is deterministic. However, the capacity of each arc is stochastic due to failure, maintenance, etc. in many real-life networks. This paper proposes a simple algorithm to evaluate the probability that d units of data can be sent from the source to the sink through the stochastic-flow network within T units of time. Such a probability is called the system reliability. The proposed algorithm firstly generates all lower boundary points for (d, T) and the system reliability can then be computed in terms of such points.