Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
NetLets: Measurement-Based Routing for End-to-End Performance over the Internet
ICN '01 Proceedings of the First International Conference on Networking-Part 1
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)
Finding the first K shortest paths in a time-window network
Computers and Operations Research
The quickest path problem with interval lead times
Computers and Operations Research
Probabilistic quickest path algorithm
Theoretical Computer Science
A label-setting algorithm for finding a quickest path
Computers and Operations Research
An algorithm for ranking quickest simple paths
Computers and Operations Research
Finding K shortest looping paths in a traffic-light network
Computers and Operations Research
On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture
The Journal of Supercomputing
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
RACON: a routing protocol for mobile cognitive radio networks
Proceedings of the 2009 ACM workshop on Cognitive radio networks
Optimal pair of minimal paths under both time and budget constraints
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Reliability problem on all pairs quickest paths
ICCS'03 Proceedings of the 2003 international conference on Computational science
Algorithms for all-pairs reliable quickest paths
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
An intermodal transport network planning algorithm using dynamic programming
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
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
Quickest path distances on context-free labeled graphs
ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
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
Finding the K shortest paths in a schedule-based transit network
Computers and Operations Research
On performance evaluation for a multistate network under spare routing
Information Sciences: an International Journal
A Scalable QoS-based inter-domain routing scheme in a high speed wide area network
Computer Communications
Distributed algorithms for the constrained routing problem in computer networks
Computer Communications
The first K shortest unique-arc walks in a traffic-light network
Mathematical and Computer Modelling: An International Journal
NetLets: measurement-based routing daemons for low end-to-end delays over networks
Computer Communications
Optimal multichannel data transmission in computer networks
Computer Communications
On update algorithms for quickest paths
Computer Communications
An algorithm for the quickest path problem
Operations Research Letters
The quickest path problem with batch constraints
Operations Research Letters
Min-Max quickest path problems
Networks
Computers and Electrical Engineering
| Hi-index | 0.01 |