{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:56:09Z","timestamp":1648670169295},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,11,17]],"date-time":"2013-11-17T00:00:00Z","timestamp":1384646400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10878-013-9681-1","type":"journal-article","created":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T23:36:45Z","timestamp":1384558605000},"page":"1062-1076","source":"Crossref","is-referenced-by-count":3,"title":["How much the grid network and rescuers\u2019 communication can improve the rescue efficiency in worst-case analysis"],"prefix":"10.1007","volume":"30","author":[{"given":"Yinfeng","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huili","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,17]]},"reference":[{"key":"9681_CR1","doi-asserted-by":"crossref","unstructured":"Adhari H, Dreibholz T, Becke M (2011) Evaluation of concurrent multipath transfer over dissimilar paths. In: Proceedings of the 25th IEEE International Conference on Advanced Information Networking and Applications Workshops (WAINA) pp 708\u2013714","DOI":"10.1109\/WAINA.2011.92"},{"issue":"2","key":"9681_CR2","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0377-2217(99)00214-3","volume":"121","author":"V Akgun","year":"2000","unstructured":"Akgun V, Erkut E, Batta R (2000) On finding dissimilar paths. Eur J Oper Res 121(2):232\u2013246","journal-title":"Eur J Oper Res"},{"issue":"11","key":"9681_CR3","doi-asserted-by":"crossref","first-page":"1610","DOI":"10.1016\/j.cor.2011.01.022","volume":"38","author":"D Catanzaro","year":"2011","unstructured":"Catanzaro D, Labbe M, Salazar-Neumann M (2011) Reduction approaches for robust shortest path problems. Comput Oper Res 38(11):1610\u20131619","journal-title":"Comput Oper Res"},{"issue":"4","key":"9681_CR4","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TBC.2006.884225","volume":"52","author":"S Cho","year":"2006","unstructured":"Cho S, Geon K, Jeong Y, Ahn C-H, Lee SI, Lee H (2006) Real time traffic information service using terrestrial digital multimedia broadcasting system. IEEE Trans Broadcast 52(4):550\u2013556","journal-title":"IEEE Trans Broadcast"},{"issue":"1","key":"9681_CR5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2003.10.033","volume":"162","author":"P Dell\u2019Olmo","year":"2007","unstructured":"Dell\u2019Olmo P, Gentili M, Scozzari A (2007) On finding dissimilar pareto-optimal paths. Eur J Oper Res 162(1):70\u201382","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9681_CR6","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein D (1998) Finding the $$k$$ k shortest paths. SIAM J Comput 28(2):652\u2013673","journal-title":"SIAM J Comput"},{"issue":"1","key":"9681_CR7","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.trc.2011.09.007","volume":"21","author":"S Gao","year":"2012","unstructured":"Gao S, Huang H (2012) Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks. Transp Res Part C 21(1):196\u2013213","journal-title":"Transp Res Part C"},{"issue":"3","key":"9681_CR8","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1287\/trsc.20.3.182","volume":"20","author":"RW Hall","year":"1986","unstructured":"Hall RW (1986) The fastest path through a network with random time-dependent travel time. Transp Sci 20(3):182\u2013188","journal-title":"Transp Sci"},{"issue":"4","key":"9681_CR9","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"N Katoh","year":"1982","unstructured":"Katoh N, Ibaraki T, Mine H (1982) An efficient algorithm for K shortest simple paths. Networks 12(4):411\u2013427","journal-title":"Networks"},{"issue":"2","key":"9681_CR10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1109\/TITS.2005.848362","volume":"6","author":"S Kim","year":"2005","unstructured":"Kim S, Lewis ME, White CC (2005) Optimal vehicle routing with real-time traffic information. IEEE Trans Intell Transp Syst 6(2):178\u2013188","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"4","key":"9681_CR11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0305-0548(76)90017-4","volume":"3","author":"PB Mirchandani","year":"1976","unstructured":"Mirchandani PB (1976) Shortest distance and reliability of probabilistic networks. Comput Oper Res 3(4):347\u2013355","journal-title":"Comput Oper Res"},{"issue":"10","key":"9681_CR12","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1016\/S0305-0548(03)00114-X","volume":"31","author":"R Montemanni","year":"2004","unstructured":"Montemanni R, Gambardella LM (2004) An exact algorithm for the robust shortest path problem with interval data. Comput Oper Res 31(10):1667\u20131680","journal-title":"Comput Oper Res"},{"issue":"2","key":"9681_CR13","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1016\/j.ejor.2005.09.019","volume":"176","author":"BW Thomas","year":"2007","unstructured":"Thomas BW, White Iii CC (2007) The dynamic shortest path problem with anticipation. Eur J Oper Res 176(2):836\u2013854","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9681_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10878-008-9156-y","volume":"18","author":"Y Xu","year":"2009","unstructured":"Xu Y, Hu M, Su B (2009) The Canadian traveller problem and its competitive analysis. J Comb Optim 18(2):195\u2013205","journal-title":"J Comb Optim"},{"key":"9681_CR15","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the K shortest loopless paths in a network. Manag Sci 17:712\u2013716","journal-title":"Manag Sci"},{"key":"9681_CR16","doi-asserted-by":"crossref","unstructured":"Zhang H, Xu Y, Qin L (2013) The k-Canadian travelers problem with communication. J Comb Optim 26(2):251\u2013265","DOI":"10.1007\/s10878-012-9503-x"},{"issue":"3","key":"9681_CR17","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/S0377-2217(03)00373-4","volume":"158","author":"P Zielinski","year":"2004","unstructured":"Zielinski P (2004) The computational complexity of the relative robust shortest path problem with interval data. Eur J Oper Res 158(3):570\u2013576","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9681-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9681-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9681-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:22Z","timestamp":1559262202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9681-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,17]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9681"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9681-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,17]]}}}