{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:54Z","timestamp":1740122394027,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T00:00:00Z","timestamp":1513209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T00:00:00Z","timestamp":1513209600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["25240004"],"award-info":[{"award-number":["25240004"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["CREST Grant Number JPMJCR1402","PRESTO Grant Numbers JPMJPR14E1"],"award-info":[{"award-number":["CREST Grant Number JPMJCR1402","PRESTO Grant Numbers JPMJPR14E1"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10878-017-0237-7","type":"journal-article","created":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T20:48:33Z","timestamp":1513284513000},"page":"1299-1314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The mixed evacuation problem"],"prefix":"10.1007","volume":"36","author":[{"given":"Yosuke","family":"Hanawa","sequence":"first","affiliation":[]},{"given":"Yuya","family":"Higashikawa","sequence":"additional","affiliation":[]},{"given":"Naoyuki","family":"Kamiyama","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Atsushi","family":"Takizawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,14]]},"reference":[{"issue":"2","key":"237_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 (2009) Earliest arrival flows with multiple sources. Math Oper Res 34(2):499\u2013512","journal-title":"Math Oper Res"},{"key":"237_CR2","volume-title":"Combinatorial optimization","author":"W\u00a0J Cook","year":"1998","unstructured":"Cook W\u00a0J, Cunningham W\u00a0H, Pulleyblank W\u00a0R, Schrijver A (1998) Combinatorial optimization. Wiley, Hoboken"},{"issue":"3","key":"237_CR3","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"LR Ford Jr","year":"1958","unstructured":"Ford LR Jr, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper Res 6(3):419\u2013433","journal-title":"Oper Res"},{"key":"237_CR4","volume-title":"Flows in networks","author":"LR Ford Jr","year":"1962","unstructured":"Ford LR Jr, Fulkerson R (1962) Flows in networks. Princeton University Press, Princeton"},{"key":"237_CR5","volume-title":"Submodular functions and optimization volume 58 of annals of discrete mathematics","author":"S Fujishige","year":"2005","unstructured":"Fujishige S (2005) Submodular functions and optimization volume 58 of annals of discrete mathematics. Elsevier, Amsterdam"},{"key":"237_CR6","volume-title":"Computers and Intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: a guide to the theory of NP-completeness. W. H Freeman and Company, London"},{"key":"237_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1993) Geometric algorithms and combinatorial optimization, 2nd edn. Springer, Berlin","edition":"2"},{"issue":"1","key":"237_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 (2000) The quickest transshipment problem. Math Oper Res 25(1):36\u201362","journal-title":"Math Oper Res"},{"issue":"4","key":"237_CR9","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata S, Fleischer L, Fujishige S (2001) A combinatorial strongly polynomial algorithm for minimizing submodular functions. J ACM 48(4):761\u2013777","journal-title":"J ACM"},{"issue":"1","key":"237_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"LG Khachiyan","year":"1980","unstructured":"Khachiyan LG (1980) Polynomial algorithms in linear programming. USSR Comput Math Math Phys 20(1):53\u201372","journal-title":"USSR Comput Math Math Phys"},{"issue":"7","key":"237_CR11","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1002\/net.3230220705","volume":"22","author":"C-L Li","year":"1992","unstructured":"Li C-L, McCormick ST, Simchi-Levi D (1992) Finding disjoint paths with different path-costs: complexity and algorithms. Networks 22(7):653\u2013667","journal-title":"Networks"},{"key":"237_CR12","first-page":"1343","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Maokai Lin","year":"2014","unstructured":"Lin M, Jaillet P (2015) On the quickest flow problem in dynamic networks\u2014a parametric min-cost flow approach. In: Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, pp 1343\u20131356"},{"issue":"2","key":"237_CR13","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin JB (1993) A faster strongly polynomial minimum cost flow algorithm. Oper Res 41(2):338\u2013350","journal-title":"Oper Res"},{"issue":"2","key":"237_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/net.21726","volume":"69","author":"M Saho","year":"2017","unstructured":"Saho M, Shigeno M (2017) Cancel-and-tighten algorithm for quickest flow problems. Networks 69(2):179\u2013188","journal-title":"Networks"},{"key":"237_CR15","doi-asserted-by":"crossref","unstructured":"Schl\u00f6ter M, Skutella M (2017) Fast and memory-efficient algorithms for evacuation problems. In: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, pp 821\u2013840","DOI":"10.1137\/1.9781611974782.52"},{"issue":"2","key":"237_CR16","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver A (2000) A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J Comb Theory Ser B 80(2):346\u2013355","journal-title":"J Comb Theory Ser B"},{"key":"237_CR17","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin"},{"key":"237_CR18","unstructured":"(2016) The headquarters for earthquake research promotion. Evaluation of long-term probability of active fault and subduction-zone earthquake occurrence. \n                    http:\/\/www.jishin.go.jp\/main\/choukihyoka\/ichiran.pdf\n                    \n                   (in Japanese)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0237-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0237-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0237-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T12:48:18Z","timestamp":1589719698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0237-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,14]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["237"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0237-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,12,14]]},"assertion":[{"value":"14 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}