Author:
Ghiyasvand Mehdi,Ramezanipour Azam
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering
Reference39 articles.
1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flow: Theory algorithms and applications. Englewood Cliffs, NJ: Prentice-Hall.
2. Busch, C., Kannan, R., & Vasilakos, A. V. (2012). Approximating congestion + dilation in networks via quality of routing games. IEEE Transactions on Computers, 61, 1270–1283.
3. Calvete, H. I. (2004). The quickest path problem with interval lead times. Computers and Operations Research, 31(3), 383–395.
4. Calvete, H. I., & del-Pozo, L. (2003). The quickest path problem with batch constraints. Operations Research Letters, 31(4), 277–284.
5. Calvete, H. I., del-Pozo, L., & Iranzo, J. A. (2012). Algorithms for the quickest path problem and the realible quickest path problem. Computational Management Science, 9, 255–272.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献