Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Extend the quickest path problem to the system reliability evaluation for a stochastic-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
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
The balanced traveling salesmanproblem
Computers and Operations Research
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
IUKM'11 Proceedings of the 2011 international conference on Integrated uncertainty in knowledge modelling and decision making
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
| Hi-index | 0.01 |