{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:56Z","timestamp":1759847816383},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T00:00:00Z","timestamp":1473292800000},"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":["Optim Lett"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11590-016-1073-x","type":"journal-article","created":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T07:55:09Z","timestamp":1473321309000},"page":"1319-1339","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["The energy-constrained quickest path problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Herminia I.","family":"Calvete","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lourdes","family":"del-Pozo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 A.","family":"Iranzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,8]]},"reference":[{"issue":"4","key":"1073_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0167-6377(02)00239-0","volume":"31","author":"H Calvete","year":"2003","unstructured":"Calvete, H., del-Pozo, L.: The quickest path problem with batch constraints. Oper. Res. Lett. 31(4), 277\u2013284 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1073_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10287-012-0138-2","volume":"9","author":"H Calvete","year":"2012","unstructured":"Calvete, H., del-Pozo, L., Iranzo, J.: Algorithms for the quickest path problem and the reliable quickest path problem. Comput. Manag. Sci. 9(2), 255\u2013272 (2012)","journal-title":"Comput. Manag. Sci."},{"key":"1073_CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0305-0548(94)90045-0","volume":"21","author":"G Chen","year":"1994","unstructured":"Chen, G., Hung, Y.: Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. 21, 113\u2013118 (1994)","journal-title":"Comput. Oper. Res."},{"key":"1073_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(94)00008-5","volume":"50","author":"Y Chen","year":"1994","unstructured":"Chen, Y.: Finding the $$k$$ k quickest simple paths in a network. Inf. Process. Lett. 50, 89\u201392 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1073_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"Y Chen","year":"1990","unstructured":"Chen, Y., Chin, Y.: The quickest path problem. Comput. Oper. Res. 17(2), 153\u2013161 (1990)","journal-title":"Comput. Oper. Res."},{"key":"1073_CR6","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1016\/j.ejor.2006.03.013","volume":"181","author":"J Cl\u00edmaco","year":"2007","unstructured":"Cl\u00edmaco, J., Pascoal, M., Craveirinha, J., Captivo, M.: Internet packet routing: application of a k-quickest path algorithm. Eur. J. Oper. Res. 181, 1045\u20131054 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1073_CR7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M Fredman","year":"1987","unstructured":"Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34(3), 596\u2013615 (1987)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1073_CR8","first-page":"227","volume-title":"Pedestrian and Evacuation Dynamics","author":"H Hamacher","year":"2002","unstructured":"Hamacher, H., Tjandra, S.: Mathematical modelling of evacuation problems: a state of the art. In: Schreckenberg, M., Sharma, S. (eds.) Pedestrian and Evacuation Dynamics, pp. 227\u2013266. Springer, Berlin (2002)"},{"issue":"5","key":"1073_CR9","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.: Netgen: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Manag. Sci. 20(5), 814\u2013821 (1974)","journal-title":"Manag. Sci."},{"issue":"4","key":"1073_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(97)00008-4","volume":"20","author":"E Martins","year":"1997","unstructured":"Martins, E., Santos, J.: An algorithm for the quickest path problem. Oper. Res. Lett. 20(4), 195\u2013198 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1073_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.10.2.113","volume":"10","author":"M Moore","year":"1976","unstructured":"Moore, M.: On the fastest route for convoy-type traffic in flowrate-constrained networks. Transp. Sci. 10(2), 113\u2013124 (1976)","journal-title":"Transp. Sci."},{"issue":"14","key":"1073_CR12","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.: A label-setting algorithm for finding a quickest path. Comput. Oper. Res. 31(14), 2405\u20132418 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1073_CR13","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0305-0548(03)00250-8","volume":"32","author":"M Pascoal","year":"2005","unstructured":"Pascoal, M., Captivo, M., Cl\u00edmaco, J.: An algorithm for ranking quickest simple paths. Comput. Oper. Res. 32(3), 509\u2013521 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1073_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-006-0068-x","volume":"147","author":"M Pascoal","year":"2006","unstructured":"Pascoal, M., Captivo, M., Cl\u00edmaco, J.: A comprehensive survey on the quickest path problem. Ann. Oper. Res. 147(1), 5\u201321 (2006)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"1073_CR15","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/s11750-007-0033-0","volume":"15","author":"M Pascoal","year":"2007","unstructured":"Pascoal, M., Captivo, M., Cl\u00edmaco, J.: Computational experiments with a lazy version of a $$k$$ k quickest simple path ranking algorithm. TOP 15(2), 372\u2013382 (2007)","journal-title":"TOP"},{"issue":"12","key":"1073_CR16","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1016\/S0305-0548(98)00036-7","volume":"25","author":"B Pelegr\u00edn","year":"1998","unstructured":"Pelegr\u00edn, B., Fern\u00e1ndez, P.: On the sum-max bicriterion path problem. Comput. Oper. Res. 25(12), 1043\u20131054 (1998)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"1073_CR17","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1016\/j.cor.2008.02.002","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4), 1299\u20131331 (2009)","journal-title":"Comput. Oper. Res."},{"key":"1073_CR18","doi-asserted-by":"crossref","unstructured":"Rao, N., Grimmell, W., Radhakrishan, S., Bang, Y., Manickam, N.: Quickest paths for different network router mechanisms. In: Proceedings of ninth International Conference on Advanced Computing and Communications (2001)","DOI":"10.2172\/769289"},{"issue":"6","key":"1073_CR19","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","volume":"18","author":"J Rosen","year":"1991","unstructured":"Rosen, J., Sun, S., Xue, G.: Algorithms for the quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. 18(6), 579\u2013584 (1991)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1073_CR20","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.ejor.2014.04.028","volume":"238","author":"A Sede\u00f1o-Noda","year":"2014","unstructured":"Sede\u00f1o-Noda, A., Gonz\u00e1lez-Barrera, J.: Fast and fine quickest path algorithm. Eur. J. Oper. Res. 238(2), 596\u2013606 (2014)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1073-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1073-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1073-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:05:50Z","timestamp":1568361950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1073-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,8]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1073"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1073-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,8]]}}}