Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Computers and Operations Research
Computers and Operations Research
An algorithm to generate all upper boundary points for (d,B) in terms of minimal cuts
Computers & Mathematics with Applications
Project management for arbitrary random durations and cost attributes by applying network approaches
Computers & Mathematics with Applications
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 novel algorithm to evaluate the performance of stochastic transportation systems
Expert Systems with Applications: An International Journal
Optimal pair of minimal paths under both time and budget constraints
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Computers & Mathematics with Applications
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
Transmission reliability of k minimal paths within time threshold
Computers and Industrial Engineering
Performance evaluation for a transportation system in stochastic case
Computers and Operations Research
| Hi-index | 0.01 |