{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T19:45:45Z","timestamp":1724701545801},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,21]],"date-time":"2014-02-21T00:00:00Z","timestamp":1392940800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10878-014-9716-2","type":"journal-article","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T04:20:40Z","timestamp":1392870040000},"page":"79-94","source":"Crossref","is-referenced-by-count":9,"title":["Minimax regret vertex 2-sink location problem in dynamic path networks"],"prefix":"10.1007","volume":"31","author":[{"given":"Hongmei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanqun","family":"Ni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,21]]},"reference":[{"key":"9716_CR1","unstructured":"Augustine J, Cheng SW, Golin MJ et al (2013) Minimax regret 1-sink location problem in dynamic path networks. Theor Comput Sci"},{"key":"9716_CR2","doi-asserted-by":"crossref","unstructured":"Cheng SW, Higashikawa Y, Katoh N et al (2013) Minimax regret 1-sink location problems in dynamic path networks. In: Theory and applications of models of computation. Springer, Berlin","DOI":"10.1007\/978-3-642-38236-9_12"},{"issue":"3","key":"9716_CR3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"LR Ford","year":"1958","unstructured":"Ford LR, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper Res 6(3):419\u2013433","journal-title":"Oper Res"},{"issue":"8","key":"9716_CR4","doi-asserted-by":"crossref","first-page":"2372","DOI":"10.1093\/ietisy\/e89-d.8.2372","volume":"89","author":"N Kamiyama","year":"2006","unstructured":"Kamiyama N, Katoh N, Takizawa A (2006) An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity. IEICE Trans Inf Syst 89(8):2372\u20132379","journal-title":"IEICE Trans Inf Syst"},{"key":"9716_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Springer, Berlin"},{"issue":"3","key":"9716_CR6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0377-2217(97)00084-2","volume":"105","author":"GG L\u00f8vs","year":"1998","unstructured":"L\u00f8vs GG (1998) Models of wayfinding in emergency evacuations. Eur J Oper Res 105(3):371\u2013389","journal-title":"Eur J Oper Res"},{"issue":"5","key":"9716_CR7","first-page":"1020","volume":"85","author":"S Mamada","year":"2002","unstructured":"Mamada S, Makino K, Fujishige S (2002) Optimal sink location problem for dynamic flows in a tree network. IEICE Trans Fundam Electron Commun Comput Sci 85(5):1020\u20131025","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"16","key":"9716_CR8","doi-asserted-by":"crossref","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 et al (2006) An $$O(n\\log ^{2}n)$$ O ( n log 2 n ) algorithm for the optimal sink location problem in dynamic tree networks. Discret Appl Math 154(16):2387\u20132401","journal-title":"Discret Appl Math"},{"key":"9716_CR9","doi-asserted-by":"crossref","unstructured":"Wang H (2013) Minmax regret 1-facity location on uncertain path networks. In: Algorithms and computation. Springer, Berlin, pp 733\u2013743","DOI":"10.1007\/978-3-642-45030-3_68"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9716-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9716-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9716-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:23Z","timestamp":1559262203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9716-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,21]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9716"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9716-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,21]]}}}