{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:40:59Z","timestamp":1759848059218},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T00:00:00Z","timestamp":1506470400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11235-017-0388-y","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T19:22:31Z","timestamp":1506540151000},"page":"217-230","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving the MCQP, MLT, and MMLT problems and computing weakly and strongly stable quickest paths"],"prefix":"10.1007","volume":"68","author":[{"given":"Mehdi","family":"Ghiyasvand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azam","family":"Ramezanipour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"388_CR1","volume-title":"Network flow: Theory algorithms and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flow: Theory algorithms and applications. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"388_CR2","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/TC.2011.145","volume":"61","author":"C Busch","year":"2012","unstructured":"Busch, C., Kannan, R., & Vasilakos, A. V. (2012). Approximating congestion + dilation in networks via quality of routing games. IEEE Transactions on Computers, 61, 1270\u20131283.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"388_CR3","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0305-0548(02)00197-1","volume":"31","author":"HI Calvete","year":"2004","unstructured":"Calvete, H. I. (2004). The quickest path problem with interval lead times. Computers and Operations Research, 31(3), 383\u2013395.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"388_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0167-6377(02)00239-0","volume":"31","author":"HI Calvete","year":"2003","unstructured":"Calvete, H. I., & del-Pozo, L. (2003). The quickest path problem with batch constraints. Operations Research Letters, 31(4), 277\u2013284.","journal-title":"Operations Research Letters"},{"key":"388_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10287-012-0138-2","volume":"9","author":"HI Calvete","year":"2012","unstructured":"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\u2013272.","journal-title":"Computational Management Science"},{"issue":"2","key":"388_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(94)00008-5","volume":"50","author":"YL Chen","year":"1994","unstructured":"Chen, Y. L. (1994). Finding the k quickest simple paths in a network. Information Processing Letters, 50(2), 89\u201392.","journal-title":"Information Processing Letters"},{"issue":"2","key":"388_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"YL Chen","year":"1990","unstructured":"Chen, Y. L., & Chin, Y. H. (1990). The quickest path problem. Computers and Operations Research, 17(2), 153\u2013161.","journal-title":"Computers and Operations Research"},{"key":"388_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0305-0548(94)90045-0","volume":"21","author":"GH Chen","year":"1994","unstructured":"Chen, G. H., & Hung, Y. C. (1994). Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Computers and Operations Research, 21, 113\u2013118.","journal-title":"Computers and Operations Research"},{"issue":"5","key":"388_CR9","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.adhoc.2011.02.004","volume":"10","author":"H Cheng","year":"2012","unstructured":"Cheng, H., Xiongb, N., Vasilakos, A. V., Yangd, L. T., Chena, G., & Zhuanga, X. (2012). Nodes organization for channel assignment withtopology preservation in multi-radio wireless mesh networks. Ad Hoc Networks, 10(5), 760\u2013773.","journal-title":"Ad Hoc Networks"},{"key":"388_CR10","doi-asserted-by":"publisher","unstructured":"Chilamkurti, N., Zeadally, S., Vasilakos, A., & Sharma, V. (2009). Cross-layer support for energy efficient routing in wireless sensor networks. Journal of Sensors, 2009, 134165. doi:\n                        10.1155\/2009\/134165\n                        \n                    .","DOI":"10.1155\/2009\/134165"},{"issue":"3","key":"388_CR11","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1016\/j.ejor.2006.03.013","volume":"181","author":"JCN Climaco","year":"2007","unstructured":"Climaco, J. C. N., Pascoal, M. M. B., Craveirinha, J. M. F., & Captivo, M. E. V. (2007). Internet packet routing: Application of K-quickest path algorithm. European Journal of Operational Research, 181(3), 1045\u20131054.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"388_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(4), 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"388_CR13","unstructured":"Hamacher, H. W., & Tjandra, S. A. (2002). Mathematical modelling of evacuation problems: A state of the art. In M. Schreckenberg & S. D. Sharma (Eds.), Pedestrian and evacuation dynamics (pp. 227\u2013266). Berlin, Heidelberg: Springer."},{"issue":"4","key":"388_CR14","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/S0305-0548(02)00025-4","volume":"30","author":"YK Lin","year":"2003","unstructured":"Lin, Y. K. (2003). Extend the quickest path problem to the system reliability evaluation for a stochastic flow network. Computers and Operations Research, 30(4), 567\u2013575.","journal-title":"Computers and Operations Research"},{"issue":"12","key":"388_CR15","doi-asserted-by":"crossref","first-page":"2538","DOI":"10.1109\/JPROC.2013.2257631","volume":"101","author":"M Li","year":"2013","unstructured":"Li, M., Li, Z., & Vasilakos, A. V. (2013). A survey on topology control in wireless sensor networks: Taxonomy, comparative study, and open issues. Proceedings of the IEEE, 101(12), 2538\u20132557.","journal-title":"Proceedings of the IEEE"},{"key":"388_CR16","unstructured":"Li, P., Guo, S., Yu, S., & Vasilakos, A. V. (2012). An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In INFOCOM (pp. 100\u2013108)."},{"key":"388_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(84)90011-0","volume":"17","author":"EQV Martins","year":"1984","unstructured":"Martins, E. Q. V. (1984). On a special class of bicriterion path problems. European Journal of Operational Research, 17, 85\u201394.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"388_CR18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(97)00008-4","volume":"20","author":"EQV Martins","year":"1997","unstructured":"Martins, E. Q. V., & Santos, J. L. E. (1997). An algorithm for the quickest path problem. Operations Research Letters, 20(4), 195\u2013198.","journal-title":"Operations Research Letters"},{"issue":"2","key":"388_CR19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.10.2.113","volume":"10","author":"MH Moore","year":"1976","unstructured":"Moore, M. H. (1976). On the fastest route for convoy-type traffic in flow rate constrained networks. Transportation Science, 10(2), 113\u2013124.","journal-title":"Transportation Science"},{"key":"388_CR20","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TC.2015.2417543","volume":"65","author":"T Meng","year":"2016","unstructured":"Meng, T., Wu, F., Yang, Z., Chen, G., & Vasilakos, A. V. (2016). Spatial reusability-aware routing in multi-hop wireless networks. IEEE Transactions on Computers, 65, 244\u2013255.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"388_CR21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-006-0068-x","volume":"147","author":"MMB Pascoal","year":"2006","unstructured":"Pascoal, M. M. B., Captivo, M. E. V., & Clmaco, J. C. N. (2006). A comprehensive survey on the quickest path problem. Annals of Operations Research, 147(1), 5\u201321.","journal-title":"Annals of Operations Research"},{"issue":"14","key":"388_CR22","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1016\/S0305-0548(03)00195-3","volume":"31","author":"CK Park","year":"2004","unstructured":"Park, C. K., Lee, S., & Park, S. (2004). A label-setting algorithm for finding a quickest path. Computers and Operations Research, 31(14), 2405\u20132418.","journal-title":"Computers and Operations Research"},{"key":"388_CR23","doi-asserted-by":"crossref","unstructured":"Quan, W., Xu, C., Vasilakos, A. V., Guan, J., Zhang, H., & Grieco, L. A. (2014). Tree-bitmap and bloom-filter for a scalable and efficient name lookup in content-centric networking. In IFIP networking.","DOI":"10.1109\/IFIPNetworking.2014.6857122"},{"issue":"6","key":"388_CR24","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","volume":"18","author":"JB Rosen","year":"1991","unstructured":"Rosen, J. B., Sun, S. Z., & Xue, G. L. (1991). Algorithms for the quickest path problem and the enumeration of quickest paths. Computers and Operations Research, 18(6), 579\u2013584.","journal-title":"Computers and Operations Research"},{"key":"388_CR25","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.21473","volume":"60","author":"S Ruzika","year":"2012","unstructured":"Ruzika, S., & Thiemann, M. (2012). Min\u2013max quickest path problems. Networks, 60, 253\u2013258.","journal-title":"Networks"},{"key":"388_CR26","doi-asserted-by":"crossref","unstructured":"Sedeo-Noda, A., & Gonzlez-Barrera, J. D. (2014). Fast and fine quickest path algorithm. European Journal of Operational Research,\n                    238, 596\u2013606.","DOI":"10.1016\/j.ejor.2014.04.028"},{"key":"388_CR27","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/j.comgeo.2014.01.004","volume":"47","author":"RE Shawi","year":"2014","unstructured":"Shawi, R. E., Gudmundsson, J., & Levcopoulos, C. (2014). Quickest path queries on transportation network. Computational Geometry, 47, 695\u2013709.","journal-title":"Computational Geometry"},{"issue":"8","key":"388_CR28","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1007\/s11276-010-0276-9","volume":"16","author":"T Spyropoulos","year":"2010","unstructured":"Spyropoulos, T., Rais, R. N. B., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349\u20132370.","journal-title":"Wireless Networks"},{"issue":"3","key":"388_CR29","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/TSMCC.2003.817354","volume":"33","author":"AV Vasilakos","year":"2003","unstructured":"Vasilakos, A. V., Saltouros, M. P., Atlassis, A. F., & Pedrycz, W. (2003). Optimizing qos routing in hierarchical ATM networks using computational intelligence techniques. IEEE Transactions on Systems, Man, and Cybernetics, 33(3), 297\u2013312.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"388_CR30","volume-title":"Delay tolerant networks: Protocols and applications","author":"AV Vasilakos","year":"2012","unstructured":"Vasilakos, A. V., Zhang, Y., & Spyropoulos, T. (2012). Delay tolerant networks: Protocols and applications. Boca Raton: CRC Press."},{"issue":"1","key":"388_CR31","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11036-011-0316-4","volume":"17","author":"X Wang","year":"2012","unstructured":"Wang, X., Vasilakos, A. V., Chen, M., Liu, Y., & Kwon, T. T. (2012). A survey of green mobile networks: Opportunities and challenges. Mobile Networks and Applications, 17(1), 4\u201320.","journal-title":"Mobile Networks and Applications"},{"key":"388_CR32","doi-asserted-by":"crossref","unstructured":"Xiang, L., Luo, J., & Vasilakos, A. V. (2011). Compressed data aggregation for energy efficient wireless sensor networks. In IEEE SECON.","DOI":"10.1109\/SAHCN.2011.5984932"},{"key":"388_CR33","doi-asserted-by":"crossref","unstructured":"Yao, Y., Cao, Q., & Vasilakos, A. V. (2013). An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for wireless sensor networks. In MASS (pp. 182\u2013190).","DOI":"10.1109\/MASS.2013.44"},{"key":"388_CR34","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/TR.2015.2452580","volume":"64","author":"WC Yeh","year":"2015","unstructured":"Yeh, W. C. (2015). A fast algorithm for quickest path reliability evaluations in multi-state flow networks. IEEE Transactions on Reliability, 64, 1175\u20131184.","journal-title":"IEEE Transactions on Reliability"},{"key":"388_CR35","doi-asserted-by":"crossref","first-page":"2238","DOI":"10.1016\/j.mcm.2010.10.008","volume":"53","author":"YS Yen","year":"2011","unstructured":"Yen, Y. S., Chao, H. C., Chang, R. S., & Vasilakos, A. V. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53, 2238\u20132250.","journal-title":"Mathematical and Computer Modelling"},{"issue":"1","key":"388_CR36","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/SURV.2013.082713.00184","volume":"16","author":"M Youssef","year":"2014","unstructured":"Youssef, M., Ibrahim, M., Abdelatif, M., Che, L., & Vasilakos, A. V. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys and Tutorials, 16(1), 92\u2013109.","journal-title":"IEEE Communications Surveys and Tutorials"},{"issue":"2","key":"388_CR37","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11276-012-0457-9","volume":"19","author":"Y Zeng","year":"2013","unstructured":"Zeng, Y., Xiang, K., Li, D., & Vasilakos, A. V. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161\u2013173.","journal-title":"Wireless Networks"},{"issue":"1","key":"388_CR38","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s11235-013-9718-x","volume":"54","author":"B Zhang","year":"2013","unstructured":"Zhang, B., Wang, Y., Vasilakos, A. V., & Ma, J. (2013). Mobile social networking: Reconnect virtual community with physical space. Telecommunication Systems, 54(1), 91\u2013110.","journal-title":"Telecommunication Systems"},{"issue":"7","key":"388_CR39","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1109\/JSAC.2011.110803","volume":"29","author":"L Zhou","year":"2011","unstructured":"Zhou, L., Chao, H. C., & Vasilakos, A. V. (2011). Joint forensics-scheduling strategy for delay-sensitive multimedia applications over heterogeneous networks. IEEE Journal on Selected Areas in Communications, 29(7), 1358\u20131367.","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-017-0388-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-017-0388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-017-0388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T18:28:23Z","timestamp":1524508103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-017-0388-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,27]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["388"],"URL":"https:\/\/doi.org\/10.1007\/s11235-017-0388-y","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,27]]}}}