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 solution approach to find the critical path in a time-constrained activity network
Computers and Operations Research
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
User-specific web-based route planning
ICCHP'10 Proceedings of the 12th international conference on Computers helping people with special needs: Part I
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
Traffic actuated car navigation systems in mobile communication networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
On performance evaluation for a multistate network under spare routing
Information Sciences: an International Journal
Solving the k-shortest path problem with time windows in a time varying network
Operations Research Letters
Finding the K shortest paths in a time-schedule network with constraints on arcs
Computers and Operations Research
Computers and Electrical Engineering
| Hi-index | 0.01 |