Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Computers and Operations Research
The quickest path problem with interval lead times
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 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
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
Distributed algorithms for the constrained routing problem in computer networks
Computer Communications
On update algorithms for quickest paths
Computer Communications
The quickest path problem with batch constraints
Operations Research Letters
Computers and Electrical Engineering
| Hi-index | 0.01 |