Author:
Ghiyasvand Mehdi,Keshtkar Iman
Publisher
Springer Science and Business Media LLC
Subject
Anesthesiology and Pain Medicine
Reference19 articles.
1. Calvete, H.I., del-Pozo, L., Iranzo, J.A.: Algorithms for the quickest path problem and the reliable quickest path problem. Comput. Manag. Sci. 9, 255–272 (2012)
2. Chen, Y.L., Chin, Y.H.: The quickest path problem. Comput. Oper. Res. 17, 153–161 (1990)
3. Climaco, J.C.N., Pascoal, M.M.B., Craveirinha, J.M.F., Captivo, M.E.V.: Internet packet routing: application of K-quickest path algorithm. Eur. J. Oper. Res. 181, 1045–1054 (2007)
4. Daskin, M.S.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York (2011)
5. Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826–834 (1977)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献