{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:04:45Z","timestamp":1742915085018,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030179526"},{"type":"electronic","value":"9783030179533"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17953-3_28","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:25:20Z","timestamp":1556753120000},"page":"370-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Earliest Arrival Transshipments in Networks with Multiple Sinks"],"prefix":"10.1007","author":[{"given":"Miriam","family":"Schl\u00f6ter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1287\/moor.1090.0382","volume":"34","author":"N Baumann","year":"2009","unstructured":"Baumann, N., Skutella, M.: Earliest arrival flows with multiple sources. Math. Oper. Res. 34, 499\u2013512 (2009). https:\/\/doi.org\/10.1287\/moor.1090.0382","journal-title":"Math. Oper. Res."},{"issue":"1","key":"28_CR2","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. Zeitschrift f\u00fcr Oper. Res. 37(1), 31\u201358 (1993). https:\/\/doi.org\/10.1007\/BF01415527","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"1","key":"28_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BF02993491","volume":"18","author":"LG Chalmet","year":"1982","unstructured":"Chalmet, L.G., Francis, R.L., Saunders, P.B.: Network models for building evacuation. Fire Technol. 18(1), 90\u2013113 (1982). https:\/\/doi.org\/10.1007\/BF02993491","journal-title":"Fire Technol."},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0095-8956\/(84)90023-6","volume":"36","author":"WH Cunningham","year":"1984","unstructured":"Cunningham, W.H.: Testing membership in matroid polyhedra. J. Comb. Theory Ser. B 36(2), 161\u2013188 (1984). https:\/\/doi.org\/10.1016\/0095-8956\/(84)90023-6","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02579361","volume":"5","author":"WH Cunningham","year":"1985","unstructured":"Cunningham, W.H.: On submodular function minimization. Combinatorica 5(3), 185\u2013192 (1985). https:\/\/doi.org\/10.1007\/BF02579361","journal-title":"Combinatorica"},{"key":"28_CR6","doi-asserted-by":"publisher","unstructured":"Disser, Y., Skutella, M.: The simplex algorithm is NP-mighty. In: Indyk, P. (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 858\u2013872. Society for Industrial and Applied Mathematics SIAM (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.59","DOI":"10.1137\/1.9781611973730.59"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.proeng.2010.07.019","volume":"3","author":"D Dressler","year":"2010","unstructured":"Dressler, D., et al.: On the use of network flow techniques for assigning evacuees to exits. Procedia Eng. 3, 205\u2013215 (2010). https:\/\/doi.org\/10.1016\/j.proeng.2010.07.019","journal-title":"Procedia Eng."},{"key":"28_CR8","unstructured":"Edmonds, J.: Submodular functions, matroids and certain polyhedra. In: Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications, pp. 69\u201387 (1970)"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/S1052623497327295","volume":"12","author":"L Fleischer","year":"2001","unstructured":"Fleischer, L.: Faster algorithms for the quickest transshipment problem. SIAM J. Optim. 12(1), 18\u201335 (2001). https:\/\/doi.org\/10.1137\/S1052623497327295","journal-title":"SIAM J. Optim."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Iwata, S.: Improved algorithms for submodular function minimization and submodular flow. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 107\u2013116. Association for Computing Machinery ACM (2000). http:\/\/doi.acm.org\/10.1145\/335305.335318","DOI":"10.1145\/335305.335318"},{"issue":"6","key":"28_CR11","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 J. Comput. 36(6), 1600\u20131630 (2007). https:\/\/doi.org\/10.1137\/S0097539703427215","journal-title":"SIAM J. Comput."},{"issue":"3\u20135","key":"28_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L Fleischer","year":"1998","unstructured":"Fleischer, L., Tardos, \u00c9.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3\u20135), 71\u201380 (1998). https:\/\/doi.org\/10.1016\/S0167-6377(98)00037-6","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"LR Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419\u2013433 (1958). https:\/\/doi.org\/10.1287\/opre.6.3.419","journal-title":"Oper. Res."},{"key":"28_CR14","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962). https:\/\/press.princeton.edu\/titles\/9233.html"},{"issue":"1","key":"28_CR15","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. Mich. Math. J. 6(1), 59\u201363 (1959). https:\/\/doi.org\/10.1307\/mmj\/1028998140","journal-title":"Mich. Math. J."},{"key":"28_CR16","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":"M Gro\u00df","year":"2012","unstructured":"Gro\u00df, M., Kappmeier, J.-P.W., Schmidt, D.R., Schmidt, M.: Approximating earliest arrival flows in arbitrary networks. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 551\u2013562. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_48"},{"issue":"3","key":"28_CR17","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 14(3), 457\u2013487 (1984). https:\/\/doi.org\/10.1002\/net.3230140308","journal-title":"Networks"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-45061-0_33","volume-title":"Automata, Languages and Programming","author":"A Hall","year":"2003","unstructured":"Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: efficient algorithms and complexity. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 397\u2013409. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_33"},{"key":"28_CR19","first-page":"227","volume-title":"Pedestrian and Evacuation Dynamics","author":"HW Hamacher","year":"2002","unstructured":"Hamacher, H.W., Tjandra, S.A.: Mathematical modelling of evacuation problems: a state of the art. In: Schreckenberg, M., Sharma, S.D. (eds.) Pedestrian and Evacuation Dynamics, pp. 227\u2013266. Springer, Heidelberg (2002)"},{"issue":"1","key":"28_CR20","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. Math. Oper. Res. 25(1), 36\u201362 (2000). https:\/\/doi.org\/10.1287\/moor.25.1.36.15211","journal-title":"Math. Oper. Res."},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-47867-1_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"S Iwata","year":"2002","unstructured":"Iwata, S.: A faster scaling algorithm for minimizing submodular functions. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 1\u20138. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-47867-1_1"},{"issue":"4","key":"28_CR22","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"Satoru Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM (JACM) 48(4), 761\u2013777 (2001). http:\/\/doi.acm.org\/10.1145\/502090.502096","journal-title":"Journal of the ACM"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/11775096_22","volume-title":"Algorithmic Aspects in Information and Management","author":"N Kamiyama","year":"2006","unstructured":"Kamiyama, N., Katoh, N., Takizawa, A.: An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 231\u2013242. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11775096_22"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"3665","DOI":"10.1016\/j.dam.2009.04.007","volume":"157","author":"N Kamiyama","year":"2009","unstructured":"Kamiyama, N., Katoh, N., Takizawa, A.: An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discrete Appl. Math. 157, 3665\u20133677 (2009). https:\/\/doi.org\/10.1016\/j.dam.2009.04.007","journal-title":"Discrete Appl. Math."},{"key":"28_CR25","unstructured":"Kappmeier, J.W.: Generalizations of flows over time with applications in evacuations optimization. Ph.D. thesis, TU Berlin (2014)"},{"key":"28_CR26","unstructured":"Klinz, B.: Cited as personal comunication (1994) in [20]"},{"key":"28_CR27","doi-asserted-by":"publisher","unstructured":"Lee, Y.T., Sidford, A., Wong, S.C.W.: A faster cutting plane method and its implications for combinatorial and convex optimization. In: 56th Annual Symposium on Foundations of Computer Science. pp. 1049\u20131065. IEEE (2015). https:\/\/doi.org\/10.1109\/focs.2015.68","DOI":"10.1109\/focs.2015.68"},{"key":"28_CR28","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1016\/j.dam.2006.04.010","volume":"154","author":"S Mamada","year":"2006","unstructured":"Mamada, S., Uno, T., Makino, K., Fujishige, S.: An $${O}(n\\log ^2n)$$ algorithm for a sink location problem in dynamic tree networks. Discrete Appl. Math. 154, 2387\u20132401 (2006). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X06001880","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"28_CR29","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. Oper. Res. 21(2), 517\u2013527 (1973). https:\/\/doi.org\/10.1287\/opre.21.2.517","journal-title":"Oper. Res."},{"issue":"2","key":"28_CR30","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-007-0189-2","volume":"118","author":"JB Orlin","year":"2009","unstructured":"Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. Math. Program. 118(2), 237\u2013251 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0189-2","journal-title":"Math. Program."},{"issue":"4","key":"28_CR31","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.15.4.640","volume":"15","author":"A Philpott","year":"1990","unstructured":"Philpott, A.: Continuous-time flows in networks. Math. Oper. Res. 15(4), 640\u2013661 (1990). https:\/\/doi.org\/10.1287\/moor.15.4.640","journal-title":"Math. Oper. Res."},{"key":"28_CR32","unstructured":"Richardson, D., Tardos, \u00c9.: Cited as personal comunication (2002) in [11]"},{"issue":"2","key":"28_CR33","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/net.20398","volume":"57","author":"S Ruzika","year":"2011","unstructured":"Ruzika, S., Sperber, H., Steiner, M.: Earliest arrival flows on series-parallel graphs. Networks 57(2), 169\u2013173 (2011). https:\/\/doi.org\/10.1002\/net.20398","journal-title":"Networks"},{"key":"28_CR34","doi-asserted-by":"publisher","unstructured":"Schl\u00f6ter, M., Skutella, M.: Fast and memory-efficient algorithms for evacuation problems. In: Klein, P.N. (ed.) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, pp. 821\u2013840. Society for Industrial and Applied Mathematics SIAM (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.52","DOI":"10.1137\/1.9781611974782.52"},{"key":"28_CR35","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.dam.2011.09.023","volume":"164","author":"M Schmidt","year":"2014","unstructured":"Schmidt, M., Skutella, M.: Earliest arrival flows in networks with multiple sinks. Discrete Appl. Math. 164, 320\u2013327 (2014). https:\/\/doi.org\/10.1016\/j.dam.2011.09.023","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"28_CR36","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory Ser. B 80(2), 346\u2013355 (2000). https:\/\/doi.org\/10.1006\/jctb.2000.1989","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"28_CR37","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L.S.: Cores of convex games. Int. J. Game Theory 1(1), 11\u201326 (1971). https:\/\/doi.org\/10.1007\/BF01753431","journal-title":"Int. J. Game Theory"},{"key":"28_CR38","doi-asserted-by":"publisher","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, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-76796-1_21","DOI":"10.1007\/978-3-540-76796-1_21"},{"key":"28_CR39","unstructured":"Tjandra, S.A.: Dynamic network optimization with application to the evacuation problem. Ph.D. thesis, TU Kaiserslautern (2003). https:\/\/kluedo.ub.uni-kl.de\/frontdoor\/index\/index\/year\/2003\/docId\/1407"},{"issue":"7","key":"28_CR40","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"WL Wilkinson","year":"1971","unstructured":"Wilkinson, W.L.: An algorithm for universal maximal dynamic flows in a network. Oper. Res. 19(7), 1602\u20131612 (1971). https:\/\/doi.org\/10.1287\/opre.19.7.1602","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17953-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:43:19Z","timestamp":1709815399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17953-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179526","9783030179533"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17953-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ann Arbor, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/umich.edu\/~ipco2019conf\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}