Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Computers and Operations Research
Optimal Multi-Path End-to-End Data Transmission in Networks
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
A label-setting algorithm for finding a quickest path
Computers and Operations Research
An algorithm for ranking quickest simple paths
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
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
Optimal multichannel data transmission in computer networks
Computer Communications
Min-Max quickest path problems
Networks
Computers and Electrical Engineering
| Hi-index | 0.90 |