{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:53:21Z","timestamp":1743116001593,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_58","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"741-752","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Orientation and Flows over Time"],"prefix":"10.1007","author":[{"given":"Ashwin","family":"Arulselvan","sequence":"first","affiliation":[]},{"given":"Martin","family":"Gro\u00df","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"key":"58_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01415527","volume":"37","author":"RE Burkard","year":"1993","unstructured":"Burkard, R.E., Dlaska, K., Klinz, B.: The quickest flow problem. Mathematical Methods of Operations Research 37, 31\u201358 (1993)","journal-title":"Mathematical Methods of Operations Research"},{"key":"58_CR2","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 36, 1600\u20131630 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"58_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"LK Fleischer","year":"1998","unstructured":"Fleischer, L.K., Tardos, \u00c9.: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters 23, 71\u201380 (1998)","journal-title":"Operations Research Letters"},{"key":"58_CR4","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"58_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-642-33090-2_48","volume-title":"Algorithms \u2013 ESA 2012","author":"Martin Gro\u00df","year":"2012","unstructured":"Gro\u00df, Martin, Kappmeier, Jan-Philipp W., Schmidt, Daniel R., Schmidt, Melanie: Approximating Earliest Arrival Flows in Arbitrary Networks. In: Epstein, Leah, Ferragina, Paolo (eds.) ESA 2012. LNCS, vol. 7501, pp. 551\u2013562. Springer, Heidelberg (2012)"},{"key":"58_CR6","doi-asserted-by":"crossref","unstructured":"Hausknecht, M., Au, T.-C., Stone, P., Fajardo, D., Waller. T.: Dynamic lane reversal in traffic management. In: 14th International IEEE Conference on Intelligent Transportation Systems (ITSC), pp. 1929\u20131934 (2011).","DOI":"10.1109\/ITSC.2011.6082932"},{"key":"58_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0885-064X(89)90017-4","volume":"5","author":"MD Hirsch","year":"1989","unstructured":"Hirsch, M.D., Papadimitriou, C.H., Vavasis, S.A.: Exponential lower bounds for finding brouwer fix points. Journal of Complexity 5, 379\u2013416 (1989)","journal-title":"Journal of Complexity"},{"key":"58_CR8","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 25, 36\u201362 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"58_CR9","unstructured":"Hoppe, B.E.: Efficient Dynamic Network Flow Algorithms. PhD thesis, Cornell University (1995)."},{"key":"58_CR10","doi-asserted-by":"crossref","unstructured":"Kim, S., Shekhar, S.: Contraflow network reconfiguration for evaluation planning: A summary of results. In: Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems, pp. 250\u2013259 (2005).","DOI":"10.1145\/1097064.1097099"},{"key":"58_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences 48, 498\u2013532 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"58_CR12","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s10878-008-9175-8","volume":"19","author":"S Rebennack","year":"2010","unstructured":"Rebennack, S., Arulselvan, A., Elefteriadou, L., Pardalos, P.M.: Complexity analysis for maximum flow problems with arc reversals. Journal of Combinatorial Optimization 19, 200\u2013216 (2010)","journal-title":"Journal of Combinatorial Optimization"},{"key":"58_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"HE Robbins","year":"1939","unstructured":"Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. The American Mathematical Monthly 46, 281\u2013283 (1939)","journal-title":"The American Mathematical Monthly"},{"key":"58_CR14","doi-asserted-by":"crossref","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 (2009).","DOI":"10.1007\/978-3-540-76796-1_21"},{"key":"58_CR15","unstructured":"Tjandra, S.A.: Dynamic network optimization with application to the evacuation problem. PhD thesis, Technical University of Kaiserslautern (2003)."},{"key":"58_CR16","unstructured":"Tuydes, H., Ziliaskopoulos, A.: Network re-design to optimize evacuation contraflow. In: Proceedings of the 83rd Annual Meeting of the Transportation Research Board, Washington, DC (2004)."},{"key":"58_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.3141\/1964-17","volume":"1964","author":"H Tuydes","year":"2006","unstructured":"Tuydes, H., Ziliaskopoulos, A.: Tabu-based heuristic approach for optimization of network evacuation contraflow. Transportation Research Record 1964, 157\u2013168 (2006)","journal-title":"Transportation Research Record"},{"key":"58_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1061\/(ASCE)1527-6988(2001)2:3(105)","volume":"2","author":"B Wolshon","year":"2001","unstructured":"Wolshon, B.: One-way-out: Contraflow freeway operation for hurricane evacuation. Natural Hazards Review 2, 105\u2013112 (2001)","journal-title":"Natural Hazards Review"},{"key":"58_CR19","volume-title":"National review of hurricane evacuation plans and policies","author":"B Wolshon","year":"2002","unstructured":"Wolshon, B., Urbina, E., Levitan, M.: National review of hurricane evacuation plans and policies. LSU Hurricane Center, Louisiana State University, Baton Rouge, Louisiana, Technical report (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:13:16Z","timestamp":1676419996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}