{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:07:33Z","timestamp":1725548853771},"publisher-location":"Berlin, Heidelberg","reference-count":95,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020933"},{"type":"electronic","value":"9783642020940"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02094-0_9","type":"book-chapter","created":{"date-parts":[[2009,6,27]],"date-time":"2009-06-27T10:45:07Z","timestamp":1246099507000},"page":"166-196","source":"Crossref","is-referenced-by-count":24,"title":["Traffic Networks and Flows over Time"],"prefix":"10.1007","author":[{"given":"Ekkehard","family":"K\u00f6hler","sequence":"first","affiliation":[]},{"given":"Rolf H.","family":"M\u00f6hring","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Network Flows. Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230130212","volume":"13","author":"Y.P. Aneja","year":"1983","unstructured":"Aneja, Y.P., Aggarwal, V., Nair, K.P.K.: Shortest chain subject to side constraints. Networks\u00a013, 295\u2013302 (1983)","journal-title":"Networks"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J.E. Aronson","year":"1989","unstructured":"Aronson, J.E.: A survey of dynamic network flows. Annals of Operations Research\u00a020, 1\u201366 (1989)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/opre.1050.0262","volume":"54","author":"F. Babonneau","year":"2006","unstructured":"Babonneau, F., du Merle, O., Vial, J.-P.: Solving large-scale linear multicommodity flow problems with an active set strategy and proximal-accpm. Operations Research\u00a054(1), 184\u2013197 (2006)","journal-title":"Operations Research"},{"key":"9_CR5","unstructured":"Bar-Gera, H.: Transportation network test problems (2002), http:\/\/www.bgu.ac.il\/~bargera\/tntp\/"},{"key":"9_CR6","unstructured":"Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for Dijkstra\u2019s algorithm (submitted) (2008)"},{"key":"9_CR7","unstructured":"Baumann, N.: Evacuation by Earliest Arrival Flows. Ph.D thesis, Universit\u00e4t Dortmund (2007)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.dam.2006.04.030","volume":"155","author":"N. Baumann","year":"2007","unstructured":"Baumann, N., K\u00f6hler, E.: Approximating earliest arrival flows with flow-dependent transit times. Discrete Appl. Math.\u00a0155, 161\u2013171 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Baumann, N., Skutella, M.: Solving evacuation problems efficiently: Earliest arrival flows with multiple sources. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, pp. 399\u2013408 (2006)","DOI":"10.1109\/FOCS.2006.70"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/VNIS.1992.639943","volume-title":"Vehicle Navigation & Information Systems Conference Proceedings (VNIS 1992)","author":"G. Beccaria","year":"1992","unstructured":"Beccaria, G., Bolelli, A.: Modelling and assessment of dynamic route guidance: the MARGOT project. In: Vehicle Navigation & Information Systems Conference Proceedings (VNIS 1992), pp. 117\u2013126. IEEE, Los Alamitos (1992)"},{"key":"9_CR11","volume-title":"Studies in the economics of transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winston, C.B.: Studies in the economics of transportation. Yale University Press, New Haven (1956)"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1061\/(ASCE)0733-947X(1997)123:4(283)","volume":"123","author":"M. Ben-Akiva","year":"1997","unstructured":"Ben-Akiva, M., Koutsopoulos, H., Mishalani, R., Yang, Q.: Simulation laboratory for evaluating dynamictraffic management systems. ASCE Journal of Transportation Engineering\u00a0123(4), 283\u2013289 (1997)","journal-title":"ASCE Journal of Transportation Engineering"},{"key":"9_CR13","volume-title":"The use of directed routes for assessing escape potential","author":"G.N. Berlin","year":"1979","unstructured":"Berlin, G.N.: The use of directed routes for assessing escape potential. National Fire Protection Association, Boston (1979)"},{"key":"9_CR14","first-page":"258","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein paradoxon aus der Verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01415527","volume":"37","author":"R.E. Burkard","year":"1993","unstructured":"Burkard, R.E., Dlaska, K., Klinz, B.: The quickest flow problem. ZOR \u2014 Methods and Models of Operations Research\u00a037, 31\u201358 (1993)","journal-title":"ZOR \u2014 Methods and Models of Operations Research"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Busaker, R.G., Gowen, P.J.: A procedure for determining minimal-cost network flow patterns. Technical Report\u00a015, Operational Research Office. John Hopkins University, Baltimore, MD (1961)","DOI":"10.21236\/AD0249662"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1287\/trsc.20.1.55","volume":"20","author":"M. Carey","year":"1986","unstructured":"Carey, M.: A constraint qualification for a dynamic traffic assignment model. Transp. Science\u00a020, 55\u201358 (1986)","journal-title":"Transp. Science"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/opre.35.1.58","volume":"35","author":"M. Carey","year":"1987","unstructured":"Carey, M.: Optimal time-varying flows on congested networks. OR\u00a035, 58\u201369 (1987)","journal-title":"OR"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0191-2615(99)00019-3","volume":"34","author":"M. Carey","year":"2000","unstructured":"Carey, M., Subrahmanian, E.: An approach for modelling time-varying flows on congested networks. Transportation Research B\u00a034, 157\u2013183 (2000)","journal-title":"Transportation Research B"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/mnsc.28.1.86","volume":"28","author":"L.G. Chalmet","year":"1982","unstructured":"Chalmet, L.G., Francis, R.L., Saunders, P.B.: Network models for building evacuation. Management Science\u00a028, 86\u2013105 (1982)","journal-title":"Management Science"},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. Mathematics of Operations Research\u00a029(4), 961\u2013976 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR22","unstructured":"DIMACS. 9th Implementation Challenge \u2013 Shortest Paths (2006)"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-662-03514-6_6","volume-title":"Operations Research and Decision Aid Methodologies in Traffic and Transportation Management","author":"S.P. Dirkse","year":"1998","unstructured":"Dirkse, S.P., Ferris, M.C.: Traffic modeling and variational inequalities using GAMS. In: Toint, P.L., Labbe, M., Tanczos, K., Laporte, G. (eds.) Operations Research and Decision Aid Methodologies in Traffic and Transportation Management, vol.\u00a0166, pp. 136\u2013163. Springer, Berlin (1998)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"2","author":"P. Elias","year":"1956","unstructured":"Elias, P., Feinstein, A., Shannon, C.E.: Note on maximum flow through a network. IRE Transactions on Information Theory\u00a0IT-2, 117\u2013119 (1956)","journal-title":"IRE Transactions on Information Theory"},{"key":"9_CR25","unstructured":"Enders, R., Lauther, U.: Method and device for computer assisted graph processing (May 1999), http:\/\/gauss.ffii.org\/PatentView\/EP1027578"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Fischer, S., R\u00e4cke, H., V\u00f6cking, B.: Fast convergence to wardrop equilibria by adaptive sampling methods. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 653\u2013662 (2006)","DOI":"10.1145\/1132516.1132608"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-47867-1_4","volume-title":"Integer Programming and Combinatorial Optimization","author":"L. Fleischer","year":"2002","unstructured":"Fleischer, L., Skutella, M.: The quickest multicommodity flow problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 36\u201353. Springer, Heidelberg (2002)"},{"key":"9_CR28","unstructured":"Fleischer, L., Skutella, M.: Minimum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Baltimore, MD, pp. 66\u201375 (2003)"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L. Fleischer","year":"2007","unstructured":"Fleischer, L., Skutella, M.: Quickest flows over time. SIAM Journal on Computing\u00a036, 1600\u20131630 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/S1052623497327295","volume":"12","author":"L.K. Fleischer","year":"2001","unstructured":"Fleischer, L.K.: Faster algorithms for the quickest transshipment problem. SIAM Journal on Optimization\u00a012, 18\u201335 (2001)","journal-title":"SIAM Journal on Optimization"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L.K. Fleischer","year":"1998","unstructured":"Fleischer, L.K., Tardos, \u00c9.: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters\u00a023, 71\u201380 (1998)","journal-title":"Operations Research Letters"},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230170307","volume":"17","author":"M. Florian","year":"1987","unstructured":"Florian, M., Gu\u00e9lat, J., Spiess, H.: An efficient implementation of the \u201cPartan\u201d variant of the linear approximation method for the network equilibrium problem. Networks\u00a017, 319\u2013339 (1987)","journal-title":"Networks"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"key":"9_CR34","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research\u00a06, 419\u2013433 (1958)","journal-title":"Operations Research"},{"key":"9_CR35","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"9_CR36","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M. Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Research Logistics Quaterly\u00a03, 95\u2013110 (1956)","journal-title":"Naval Research Logistics Quaterly"},{"key":"9_CR37","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D. Gale","year":"1959","unstructured":"Gale, D.: Transient flows in networks. Michigan Mathematical Journal\u00a06, 59\u201363 (1959)","journal-title":"Michigan Mathematical Journal"},{"key":"9_CR38","unstructured":"Gartner, N., Messer, C.J., Rathi, A.K.: Traffic flow theory: A state of the art report (1997), http:\/\/www-cta.ornl.gov\/cta\/research\/trb\/tft.html"},{"key":"9_CR39","unstructured":"Hagstrom, J.N., Abrams, R.A.: Characterizing braess\u2019s paradox for traffic networks. In: Proceedings of IEEE 2001 Conference on Intelligent Transportation Systems, pp. 837\u2013842 (2001)"},{"key":"9_CR40","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/net.3230140308","volume":"14","author":"B. Hajek","year":"1984","unstructured":"Hajek, B., Ogier, R.G.: Optimal dynamic routing in communication networks with continuous traffic. Networks\u00a014, 457\u2013487 (1984)","journal-title":"Networks"},{"key":"9_CR41","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.tcs.2007.02.046","volume":"379","author":"A. Hall","year":"2007","unstructured":"Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: Efficient algorithms and complexity. Theoretical Computer Science\u00a0379, 387\u2013404 (2007)","journal-title":"Theoretical Computer Science"},{"key":"9_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-540-45198-3_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Hall","year":"2003","unstructured":"Hall, A., Langkau, K., Skutella, M.: An FPTAS for quickest multicommodity flows with inflow-dependent transit times. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 71\u201382. Springer, Heidelberg (2003)"},{"issue":"3","key":"9_CR43","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-006-0196-3","volume":"47","author":"A. Hall","year":"2007","unstructured":"Hall, A., Langkau, K., Skutella, M.: An FPTAS for quickest multicommodity flows with inflow-dependent transit times. Algorithmica\u00a047(3), 299\u2013321 (2007)","journal-title":"Algorithmica"},{"key":"9_CR44","first-page":"55","volume-title":"Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX 2005)","author":"A. Hall","year":"2005","unstructured":"Hall, A., Schilling, H.: Flows over time: Towards a more realistic and computationally tractable model. In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX 2005), Vancouver, Canada, pp. 55\u201367. SIAM, Philadelphia (2005)"},{"key":"9_CR45","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/1520-6750(198708)34:4<487::AID-NAV3220340404>3.0.CO;2-9","volume":"34","author":"H.W. Hamacher","year":"1987","unstructured":"Hamacher, H.W., Tifecki, S.: On the use of lexicographic min cost flows in evacuation modeling. Naval Research Logistics\u00a034, 487\u2013503 (1987)","journal-title":"Naval Research Logistics"},{"key":"9_CR46","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1002\/sapm1941201224","volume":"20","author":"F.L. Hitchcock","year":"1941","unstructured":"Hitchcock, F.L.: The distribution of a product from several sources to numerous localities. Journal of Mathematics and Physics\u00a020, 224\u2013230 (1941)","journal-title":"Journal of Mathematics and Physics"},{"key":"9_CR47","unstructured":"Hoppe, B.: Efficient dynamic network flow algorithms. Ph.D thesis, Cornell University (1995)"},{"key":"9_CR48","unstructured":"Hoppe, B., Tardos, \u00c9.: Polynomial time algorithms for some evacuation problems. In: Proceedings of the 5th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Arlington, VA, pp. 433\u2013441 (1994)"},{"key":"9_CR49","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"Hoppe, B., Tardos, \u00c9.: The quickest transshipment problem. Mathematics of Operations Research\u00a025, 36\u201362 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR50","first-page":"27","volume":"26","author":"M. Iri","year":"1960","unstructured":"Iri, M.: A new method of solving transportation-network problems. Journal of the Operations Research Society of Japan\u00a026, 27\u201387 (1960)","journal-title":"Journal of the Operations Research Society of Japan"},{"issue":"4","key":"9_CR51","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1287\/opre.1040.0197","volume":"53","author":"O. Jahn","year":"2005","unstructured":"Jahn, O., M\u00f6hring, R.H., Schulz, A.S., Stier Moses, N.E.: System-optimal routing of traffic flows with user constraints in networks with congestion. Oper. Res.\u00a053(4), 600\u2013616 (2005)","journal-title":"Oper. Res."},{"key":"9_CR52","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1287\/mnsc.28.1.106","volume":"28","author":"J.J. Jarvis","year":"1982","unstructured":"Jarvis, J.J., Ratliff, H.D.: Some equivalent objectives for dynamic network flow problems. Management Science\u00a028, 106\u2013108 (1982)","journal-title":"Management Science"},{"key":"9_CR53","unstructured":"Jewel, P.A.: Optimal flow through networks. Technical Report\u00a08, Operations Research Center. MIT, Cambridge (1958)"},{"key":"9_CR54","first-page":"199","volume":"37","author":"L.V. Kantorovich","year":"1942","unstructured":"Kantorovich, L.V.: On the translocation of masses. Comptes Rendus (Doklady) de l\u2019Acad\u00e9mie des Sciences de l\u2019U.R.S.S.\u00a037, 199\u2013201 (1942)","journal-title":"Comptes Rendus (Doklady) de l\u2019Acad\u00e9mie des Sciences de l\u2019U.R.S.S."},{"key":"9_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-59408-6_62","volume-title":"Integer Programming and Combinatorial Optimization","author":"B. Klinz","year":"1995","unstructured":"Klinz, B., Woeginger, G.J.: Minimum cost dynamic flows: The series-parallel case. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol.\u00a0920, pp. 329\u2013343. Springer, Heidelberg (1995)"},{"key":"9_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/3-540-45749-6_53","volume-title":"Algorithms - ESA 2002","author":"E. K\u00f6hler","year":"2002","unstructured":"K\u00f6hler, E., Langkau, K., Skutella, M.: Time-expanded graphs with flow-dependent transit times. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 599\u2013611. Springer, Heidelberg (2002)"},{"key":"9_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11427186_13","volume-title":"Experimental and Efficient Algorithms","author":"E. K\u00f6hler","year":"2005","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Acceleration of shortest path and constrained shortest path computation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 126\u2013138. Springer, Heidelberg (2005)"},{"key":"9_CR58","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Fast point-to-point shortest path computations with arc-flags (February 2008); submitted to the Special Issue about the 9th DIMACS Implementation Challenge Workshop"},{"key":"9_CR59","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Skutella, M.: Traffic networks and flows over time. In: Kramer, J. (ed.) DFG Research Center: Mathematics for Key Technologies, pp. 49\u201370. Berliner Mathematische Gesellschaft (2002)"},{"key":"9_CR60","unstructured":"K\u00f6hler, E., Skutella, M.: Flows over time with load-dependent transit times. In: Proceedings of the 13th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 174\u2013183 (2002)"},{"key":"9_CR61","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1137\/S1052623403432645","volume":"15","author":"E. K\u00f6hler","year":"2005","unstructured":"K\u00f6hler, E., Skutella, M.: Flows over time with load-dependent transit times. SIAM Journal on Optimization\u00a015, 1185\u20131202 (2005)","journal-title":"SIAM Journal on Optimization"},{"key":"9_CR62","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-69995-8_8","volume-title":"Operations Research Proceedings 2006","author":"F. K\u00f6nig","year":"2007","unstructured":"K\u00f6nig, F.: Traffic optimization under route constraints with Lagrangian relaxation and cutting plane methods. In: Operations Research Proceedings 2006, pp. 53\u201359. Springer, Heidelberg (2007)"},{"key":"9_CR63","doi-asserted-by":"publisher","first-page":"136","DOI":"10.2307\/1907301","volume":"17","author":"T.C. Koopmans","year":"1949","unstructured":"Koopmans, T.C.: Optimum utilization of the transportation system. Econometrica\u00a017, 136\u2013146 (1949)","journal-title":"Econometrica"},{"key":"9_CR64","unstructured":"Kotnyek, B.: An annotated overview of dynamic network flows. Rapport de recherche 4936, INRIA Sophia Antipolis (2003)"},{"key":"9_CR65","unstructured":"Langkau, K.: Flows Over Time with Flow-Dependent Transit Times. Ph.D thesis, TU Berlin (2003)"},{"key":"9_CR66","unstructured":"Lauther, U.: Slow preprocessing of graphs for extremely fast shortest path calculations. In: Lecture at the Workshop on Computational Integer Programming at ZIB (no documentation available) (1997)"},{"key":"9_CR67","unstructured":"Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Raubal, M., Sliwinski, A., Kuhn, W. (eds.) Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung, M\u00fcnster, Germany. IfGI prints, vol.\u00a022, pp. 219\u2013230. Institut f\u00fcr Geoinformatik, Westf\u00e4lische Wilhelms-Universit\u00e4t (2004)"},{"key":"9_CR68","first-page":"1417","volume":"48","author":"S.E. Lovetskii","year":"1987","unstructured":"Lovetskii, S.E., Melamed, I.I.: Dynamic network flows. Automation and Remote Control\u00a048, 1417\u20131434 (1987); Translated from Avtomatika i Telemekhanika 11, 7\u201329 (1987)","journal-title":"Automation and Remote Control"},{"key":"9_CR69","doi-asserted-by":"publisher","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":"Mahmassani, H.S., Peeta, S.: System optimal dynamic assignment for electronic route guidance in a congested traffic network. In: Gartner, N.H., Improta, G. (eds.) Urban Traffic Networks. Dynamic Flow Modelling and Control, pp. 3\u201337. Springer, Berlin (1995)"},{"key":"9_CR70","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-32539-5_47","volume-title":"Operations Research Proceedings 2005","author":"M. Martens","year":"2006","unstructured":"Martens, M., Skutella, M.: Length-bounded and dynamic k-splittable flows. In: Haasis, H.-D., Kopfer, H., Sch\u00f6nberger, J. (eds.) Operations Research Proceedings 2005, pp. 297\u2013302. Springer, Heidelberg (2006)"},{"key":"9_CR71","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Mathematics of Operations Research\u00a04, 414\u2013424 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR72","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM\u00a030, 852\u2013865 (1983)","journal-title":"Journal of the ACM"},{"key":"9_CR73","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1287\/trsc.12.3.183","volume":"12","author":"D.K. Merchant","year":"1978","unstructured":"Merchant, D.K., Nemhauser, G.L.: A model and an algorithm for the dynamic traffic assignment problems. Transp. Science\u00a012, 183\u2013199 (1978)","journal-title":"Transp. Science"},{"key":"9_CR74","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1287\/trsc.12.3.200","volume":"12","author":"D.K. Merchant","year":"1978","unstructured":"Merchant, D.K., Nemhauser, G.L.: Optimality conditions for a dynamic traffic assignment model. Transp. Science\u00a012, 200\u2013207 (1978)","journal-title":"Transp. Science"},{"key":"9_CR75","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E. Minieka","year":"1973","unstructured":"Minieka, E.: Maximal, lexicographic, and dynamic network flows. Operations Research\u00a021, 517\u2013527 (1973)","journal-title":"Operations Research"},{"key":"9_CR76","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speed-up Dijkstra\u2019s algorithm. ACM Journal of Experimental Algorithmics\u00a011, Article No. 2.8 (2006)","DOI":"10.1145\/1187436.1216585"},{"key":"9_CR77","first-page":"151","volume-title":"Annual Review of Computational Physics VII","author":"K. Nagel","year":"2000","unstructured":"Nagel, K., Esser, J., Rickert, M.: Large-scale traffic simulations for transportation planning. In: Stauffer, D. (ed.) Annual Review of Computational Physics VII, pp. 151\u2013202. World Scientific Publishing Company, Singapore (2000)"},{"key":"9_CR78","volume-title":"Traffic Assignment Problems: Models and Methods","author":"M. Patriksson","year":"1994","unstructured":"Patriksson, M.: Traffic Assignment Problems: Models and Methods. VSP International Science Publishers, Utrecht (1994)"},{"key":"9_CR79","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0927-0507(05)80107-0","volume-title":"Network Routing","author":"W.B. Powell","year":"1995","unstructured":"Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing. Handbooks in Operations Research and Management Science, ch. 3, vol.\u00a08, pp. 141\u2013295. North-Holland, Amsterdam (1995)"},{"key":"9_CR80","volume-title":"Kinetic Theory of Vehicular Traffic","author":"I. Prigogine","year":"1971","unstructured":"Prigogine, I., Herman, R.: Kinetic Theory of Vehicular Traffic. Elsevier Science B. V., Amsterdam (1971)"},{"key":"9_CR81","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-80230-0","volume-title":"Modelling Dynamic Transportation Networks","author":"B. Ran","year":"1996","unstructured":"Ran, B., Boyce, D.E.: Modelling Dynamic Transportation Networks. Springer, Berlin (1996)"},{"key":"9_CR82","unstructured":"Roughgarden, T.: How unfair is optimal routing? In: Proceedings of the 13th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 203\u2013204 (2002)"},{"key":"9_CR83","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? In. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science FOCS 2000, pp. 93\u2013102 (2000)","DOI":"10.1109\/SFCS.2000.892069"},{"key":"9_CR84","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"Algorithms \u2013 ESA 2005","author":"P. Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 568\u2013579. Springer, Heidelberg (2005)"},{"key":"9_CR85","unstructured":"Schilling, H.: Route Assignment Problems in Large Networks. Ph.D thesis, Technische Universit\u00e4t Berlin (2006)"},{"issue":"4","key":"9_CR86","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/net.20133","volume":"48","author":"A.S. Schluz","year":"2006","unstructured":"Schluz, A.S., Stier Moses, N.E.: Efficiency and fairness of system-optimal routing with user constraints. Networks\u00a048(4), 223\u2013234 (2006)","journal-title":"Networks"},{"key":"9_CR87","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s101070100259","volume":"91","author":"A. Schrijver","year":"2002","unstructured":"Schrijver, A.: On the history of the transportation and maximum flow problem. Mathematical Programming\u00a091, 437\u2013445 (2002)","journal-title":"Mathematical Programming"},{"key":"9_CR88","unstructured":"Schultes, D.: Route Planning in Road Networks. Ph.D thesis, Universit\u00e4t Karlsruhe, TH (2008)"},{"key":"9_CR89","volume-title":"Urban Transportation Networks","author":"Y. Sheffi","year":"1985","unstructured":"Sheffi, Y.: Urban Transportation Networks. Prentice Hall, Englewood Cliffs (1985), http:\/\/web.mit.edu\/sheffi\/www\/urbanTransportation.html"},{"key":"9_CR90","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization","author":"M. Skutella","year":"2009","unstructured":"Skutella, M.: An introduction to network flows over time. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Berlin (2009)"},{"key":"9_CR91","unstructured":"Tjandra, S.: Dynamic Network Optimization with Application to the Evacuation Problem. Ph.D thesis, Univerist\u00e4t Kaiserslautern. Shaker Verlag, Aachen (2003)"},{"key":"9_CR92","unstructured":"Verkehrsmanagement \u2014 Eine Bestandsaufnahme. Brosch\u00fcre. Erstellt von L\u00f6sch & Partner GmbH, M\u00fcnchen, in Zusammenarbeit mit diversen deutschen Automobilherstellern (1995)"},{"issue":"2","key":"9_CR93","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1680\/ipeds.1952.11259","volume":"1","author":"J.G. Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers\u00a01(2), 325\u2013362 (1952)","journal-title":"Proceedings of the Institution of Civil Engineers"},{"key":"9_CR94","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"W.L. Wilkinson","year":"1971","unstructured":"Wilkinson, W.L.: An algorithm for universal maximal dynamic flows in a network. Operations Research\u00a019, 1602\u20131612 (1971)","journal-title":"Operations Research"},{"key":"9_CR95","unstructured":"Willhalm, T.: Engineering Shortest Paths and Layout Algorithms for Large Graphs. Ph.D thesis, Universit\u00e4t Karlsruhe (TH), Karlsruhe (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Large and Complex Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02094-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:46:53Z","timestamp":1558396013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02094-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020933","9783642020940"],"references-count":95,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02094-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}