{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:54:20Z","timestamp":1760608460495},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_53","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:42:44Z","timestamp":1183549364000},"page":"599-611","source":"Crossref","is-referenced-by-count":62,"title":["Time-Expanded Graphs for Flow-Dependent Transit Times"],"prefix":"10.1007","author":[{"given":"Ekkehard","family":"K\u00f6hler","sequence":"first","affiliation":[]},{"given":"Katharina","family":"Langkau","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J.E. Aronson","year":"1989","unstructured":"J.E. Aronson. A survey of dynamic network flows. Annals of OR, 20:1\u201366, 1989.","journal-title":"Annals of OR"},{"key":"53_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01415527","volume":"37","author":"R.E. Burkard","year":"1993","unstructured":"R.E. Burkard, K. Dlaska, and B. Klinz. The quickest flow problem. ZOR Methods and Models of Operations Research, 37:31\u201358, 1993.","journal-title":"ZOR Methods and Models of Operations Research"},{"key":"53_CR3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1287\/trsc.20.1.55","volume":"20","author":"M. Carey","year":"1986","unstructured":"M. Carey. A constraint qualification for a dynamic traffic assignment model. Transp. Science, 20:55\u201358, 1986.","journal-title":"Transp. Science"},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.35.1.58","volume":"35","author":"M. Carey","year":"1987","unstructured":"M. Carey. Optimal time-varying flows on congested networks. OR, 35:58\u201369, 1987.","journal-title":"OR"},{"key":"53_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0191-2615(99)00019-3","volume":"34","author":"M. Carey","year":"2000","unstructured":"M. Carey and E. Subrahmanian. An approach for modelling time-varying flows on congested networks. Transportation Research B, 34:157\u2013183, 2000.","journal-title":"Transportation Research B"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"L. Fleischer and M. Skutella. The quickest multicommodity flow problem. In Proc. of IPCO\u201902, 2002.","DOI":"10.1007\/3-540-47867-1_4"},{"key":"53_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L. Fleischer","year":"1998","unstructured":"L. Fleischer and \u00c9. Tardos. Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23:71\u201380, 1998.","journal-title":"Operations Research Letters"},{"key":"53_CR8","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"L.R. Ford and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6:419\u2013433, 1958.","journal-title":"Operations Research"},{"key":"53_CR9","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"L.R. Ford and D.R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962."},{"key":"53_CR10","unstructured":"N. Gartner, C. J. Messer, and A.K. Rathi. Traffic flow theory: A state of the art report. \n                    http:\/\/www-cta.ornl.gov\/cta\/research\/trb\/tft.html\n                    \n                  , 1997."},{"key":"53_CR11","unstructured":"E. K\u00f6hler and M. Skutella. Flows over time with load-dependent transit times. In Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002."},{"key":"53_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-79641-8_1","volume-title":"Urban Traffic Networks. Dynamic Flow Modelling and Control","author":"H. S. Mahmassani","year":"1995","unstructured":"H. S. Mahmassani and S. Peeta. System optimal dynamic assignment for electronic route guidance in a congested traffic network. In Urban Traffic Networks. Dynamic Flow Modelling and Control, pages 3\u201337. Springer, Berlin, 1995."},{"key":"53_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1287\/trsc.12.3.183","volume":"12","author":"D. K. Merchant","year":"1978","unstructured":"D. K. Merchant and G. L. Nemhauser. A model and an algorithm for the dynamic traffic assignment problems. Transp. Science, 12:183\u2013199, 1978.","journal-title":"Transp. Science"},{"key":"53_CR14","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/trsc.12.3.200","volume":"12","author":"D.K. Merchant","year":"1978","unstructured":"D.K. Merchant and G. L. Nemhauser. Optimality conditions for a dynamic traffic assignment model. Transp. Science, 12:200\u2013207, 1978.","journal-title":"Transp. Science"},{"key":"53_CR15","first-page":"141","volume":"8","author":"W. B. Powell","year":"1995","unstructured":"W. B. Powell, P. Jaillet, and A. Odoni. Stochastic and dynamic networks and routing. Handb. in OR and Man.Sc. vol. 8, pages 141\u2013295. North-Holland, 1995.","journal-title":"Handb. in OR and Man.Sc."},{"key":"53_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-80230-0","volume-title":"Modelling Dynamic Transportation Networks","author":"B. Ran","year":"1996","unstructured":"B. Ran and D. E. Boyce. Modelling Dynamic Transportation Networks. Springer, Berlin, 1996."},{"key":"53_CR17","volume-title":"Urban Transportation Networks","author":"Y. Sheffi","year":"1985","unstructured":"Y. Sheffi. Urban Transportation Networks. Prentice-Hall, New Jersey, 1985."}],"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_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T12:40:38Z","timestamp":1550407238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_53","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}