{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T05:59:01Z","timestamp":1774677541428,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441809","type":"print"},{"value":"9783540457497","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_15","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"126-138","source":"Crossref","is-referenced-by-count":22,"title":["Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router"],"prefix":"10.1007","author":[{"given":"Chris","family":"Barrett","sequence":"first","affiliation":[]},{"given":"Keith","family":"Bisset","sequence":"additional","affiliation":[]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[]},{"given":"Goran","family":"Konjevod","sequence":"additional","affiliation":[]},{"given":"Madhav","family":"Marathe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"15_CR1","unstructured":"C. Barrett, K. Bisset, R. Jacob, G. Konjevod and M. Marathe Algorithms and models for routing and transportation problems in in time-dependent and labeled networks, in preparation, 2002."},{"key":"15_CR2","unstructured":"C. Barrett, K. Birkbigler, L. Smith, V. Loose, R. Beckman, J. Davis, D. Roberts and M. Williams, An Operational Description of TRANSIMS, Technical Report, LA-UR-95-2393, Los Alamos National Laboratory, 1995."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"C. Barrett, D. Cook, V. Faber, G. Hicks, A. Marathe, M. Marathe, A. Srinivasan, Y. J. Sussmann and H. Thornquist, Experimental analysis of algorithms for bilateral-contract clearing mechanisms arising in deregulated power industry, Proc. WAE 2001, pp. 172\u2013184.","DOI":"10.1007\/3-540-44688-5_14"},{"issue":"3","key":"15_CR4","first-page":"809","volume":"30","author":"C. Barrett","year":"2001","unstructured":"C. Barrett, R. Jacob, M. Marathe, Formal Language Constrained Path Problems in SIAM J. Computing, 30(3), pp. 809\u2013837, June2001.","journal-title":"Formal Language Constrained Path Problems in SIAM J. Computing"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"I. Chabini, Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time, Presented at 1997 Transportation Research Board Meeting.","DOI":"10.3141\/1645-21"},{"key":"15_CR6","first-page":"129","volume":"73","author":"B. Cherkassky","year":"1996","unstructured":"B. Cherkassky, A. Goldberg and T. Radzik, Shortest Path algorithms: Theory and Experimental Evaluation, Mathematical Programming, Vol. 73, 1996, pp. 129\u2013174.","journal-title":"Mathematical Programming"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"R. Jacob, M. Marathe and K. Nagel, A Computational Study of Routing Algorithms for Realistic Transportation Networks, invited paper appears in ACM J. Experimental Algorithmics, 4, Article 6, 1999. http:\/\/www.jea.acm.org\/1999\/JacobRouting\/ Preliminary version appeared in Proc. 2nd Workshop on Algorithmic Engineering, Saarbrucken,Germany, August 1998.","DOI":"10.1145\/347792.347814"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"C. L. Barrett, M. Drozda, A. Marathe, and M. Marathe, Characterizing the interaction between routing and MAC protocols in ad-hoc networks, to appear in Proc. ACM MobiHoc 2002.","DOI":"10.1145\/513800.513812"},{"issue":"6","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"4","author":"A. Mendelzon","year":"1995","unstructured":"A. Mendelzon and P. Wood, Finding Regular Simple Paths in Graph Databases, SIAM J. Computing, vol. 24, No. 6, 1995, pp. 1235\u20131258.","journal-title":"SIAM J. Computing"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"A. Orda and R. Rom, Shortest Path and Minimum Delay Algorithms in Networks with Time Dependent Edge Lengths, J. ACM, Vol. 37, No. 3, 1990, pp. 607\u2013625.","journal-title":"J. ACM"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0020-0190(88)90198-6","volume":"28","author":"J. F. Romeuf","year":"1988","unstructured":"J. F. Romeuf, Shortest Path under Rational Constraint Information Processing Letters 28 (1988), pp. 245\u2013248.","journal-title":"Shortest Path under Rational Constraint Information Processing Letters"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01840435","volume":"1","author":"R. Sedgewick","year":"1986","unstructured":"R. Sedgewick and J. Vitter Shortest Paths in Euclidean Graphs, Algorithmica, 1986, Vol. 1, No. 1, pp. 31\u201348.","journal-title":"Algorithmica"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0377-2217(99)00035-1","volume":"121","author":"K. Sung","year":"2000","unstructured":"K. Sung and M.G.H. Bell and M. Seong and S. Park, Shortest paths in a network with time-dependent flow speeds, European Journal of Operational Research 121 (1) (2000), pp. 32\u201339.","journal-title":"European Journal of Operational Research"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"M. Yannakakis \u201cGraph Theoretic Methods in Data Base Theory,\u201d invited talk, Proc. 9th ACM SIGACT-SIGMOD-SIGART Symposium on Database Systems (ACM-PODS), NashvilleTN, 1990, pp. 230\u2013242.","DOI":"10.1145\/298514.298576"},{"key":"15_CR15","unstructured":"A. Ziliaskopoulos and H. Mahmassani, Minimum Path Algorithms for Networks with General Time Dependent Arc Costs, Technical Report, December 1997."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T03:06:31Z","timestamp":1556593591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}