{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:53:11Z","timestamp":1762271591344},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,1,13]],"date-time":"2012-01-13T00:00:00Z","timestamp":1326412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s10287-012-0138-2","type":"journal-article","created":{"date-parts":[[2012,1,12]],"date-time":"2012-01-12T02:00:28Z","timestamp":1326333628000},"page":"255-272","source":"Crossref","is-referenced-by-count":27,"title":["Algorithms for the quickest path problem and the reliable quickest path problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Herminia I.","family":"Calvete","sequence":"first","affiliation":[]},{"given":"Lourdes","family":"del-Pozo","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 A.","family":"Iranzo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,13]]},"reference":[{"key":"138_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/net.3230130212","volume":"13","author":"YP Aneja","year":"1983","unstructured":"Aneja YP, Aggarwal V, Nair KPK (1983) Shortest chain subject to side constraints. Networks 13: 295\u2013302","journal-title":"Networks"},{"issue":"3","key":"138_CR2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0305-0548(02)00197-1","volume":"31","author":"HI Calvete","year":"2004","unstructured":"Calvete HI (2004) The quickest path problem with interval lead times. Comput Oper Res 31(3): 383\u2013395","journal-title":"Comput Oper Res"},{"issue":"4","key":"138_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0167-6377(02)00239-0","volume":"31","author":"HI Calvete","year":"2003","unstructured":"Calvete HI, del-Pozo L (2003) The quickest path problem with batch constraints. Oper Res Lett 31(4): 277\u2013284","journal-title":"Oper Res Lett"},{"key":"138_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0305-0548(94)90045-0","volume":"21","author":"GH Chen","year":"1994","unstructured":"Chen GH, Hung YC (1994) Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Comput Operat Res 21: 113\u2013118","journal-title":"Comput Operat Res"},{"key":"138_CR5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(94)00008-5","volume":"50","author":"YL Chen","year":"1994","unstructured":"Chen YL (1994) Finding the k quickest simple paths in a network. Inform Process Lett 50: 89\u201392","journal-title":"Inform Process Lett"},{"issue":"2","key":"138_CR6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"YL Chen","year":"1990","unstructured":"Chen YL, Chin YH (1990) The quickest path problem. Comput Oper Res 17(2): 153\u2013161","journal-title":"Comput Oper Res"},{"issue":"3","key":"138_CR7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J Assoc Comput Mach 34(3): 596\u2013615","journal-title":"J Assoc Comput Mach"},{"issue":"5","key":"138_CR8","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D Klingman","year":"1974","unstructured":"Klingman D, Napier A, Stutz J (1974) Netgen: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Manag Sci 20(5): 814\u2013821","journal-title":"Manag Sci"},{"key":"138_CR9","volume-title":"Combinatorial optimization: networks and matroids","author":"E Lawler","year":"1976","unstructured":"Lawler E (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart & Winston, New York"},{"issue":"4","key":"138_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(97)00008-4","volume":"20","author":"EQV Martins","year":"1997","unstructured":"Martins EQV, Santos JLE (1997) An algorithm for the quickest path problem. Oper Res Lett 20(4): 195\u2013198","journal-title":"Oper Res Lett"},{"issue":"2","key":"138_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.10.2.113","volume":"10","author":"MH Moore","year":"1976","unstructured":"Moore MH (1976) On the fastest route for convoy-type traffic in flowrate-constrained networks. Transp Sci 10(2): 113\u2013124","journal-title":"Transp Sci"},{"issue":"14","key":"138_CR12","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1016\/S0305-0548(03)00195-3","volume":"31","author":"C-K Park","year":"2004","unstructured":"Park C-K, Lee S, Park S (2004) A label-setting algorithm for finding a quickest path. Comput Oper Res 31(14): 2405\u20132418","journal-title":"Comput Oper Res"},{"issue":"1","key":"138_CR13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-006-0068-x","volume":"147","author":"MMB Pascoal","year":"2006","unstructured":"Pascoal MMB, Captivo MEV, Cl\u00edmaco JCN (2006) A comprehensive survey on the quickest path problem. Ann Oper Res 147(1): 5\u201321","journal-title":"Ann Oper Res"},{"issue":"6","key":"138_CR14","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","volume":"18","author":"JB Rosen","year":"1991","unstructured":"Rosen JB, Sun SZ, Xue GL (1991) Algorithms for the quickest path problem and the enumeration of quickest paths. Comput Oper Res 18(6): 579\u2013584","journal-title":"Comput Oper Res"},{"issue":"6","key":"138_CR15","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/4234.681357","volume":"2","author":"G Xue","year":"1998","unstructured":"Xue G (1998) End-to-end data paths: quickest or most reliable?. IEEE Commun Lett 2(6): 156\u2013158","journal-title":"IEEE Commun Lett"},{"issue":"11","key":"138_CR16","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J Yen","year":"1971","unstructured":"Yen J (1971) Finding the k shortest loopless paths in a network. Manag Sci 17(11): 712\u2013716","journal-title":"Manag Sci"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-012-0138-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-012-0138-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-012-0138-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:49Z","timestamp":1559131969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-012-0138-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,13]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["138"],"URL":"https:\/\/doi.org\/10.1007\/s10287-012-0138-2","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,13]]}}}