A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay
International Journal of Network Management
On computing sets of shortest paths in a graph
Communications of the ACM
On finding minimum routes in a network with turn penalties
Communications of the ACM
Modeling Costs of Turns in Route Planning
Geoinformatica
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Some theoretical aspects of algorithmic routing
DAC '77 Proceedings of the 14th Design Automation Conference
Generating k-best solutions to auction winner determination problems
ACM SIGecom Exchanges
Finding the K shortest hyperpaths
Computers and Operations Research
Finding the k shortest simple paths: A new algorithm and its implementation
ACM Transactions on Algorithms (TALG)
Decomposition heuristic to minimize total cost in a multi-level supply chain network
Computers and Industrial Engineering
Determining fastest routes using fixed schedules
AFIPS '63 (Spring) Proceedings of the May 21-23, 1963, spring joint computer conference
An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Fast top-k simple shortest paths discovery in graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Simulation-based deadlock avoidance and optimization in bidirectional AGVS
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
Conditional estimators: an effective attack on A5/1
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
A content aware and name based routing network speed up system
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
| Hi-index | 0.04 |