{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:59:10Z","timestamp":1772614750878,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T00:00:00Z","timestamp":1589760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T00:00:00Z","timestamp":1589760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the MOE (Ministry of Education in China) Project of Humanities and Social Sciences","award":["18YJC630114"],"award-info":[{"award-number":["18YJC630114"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71701162"],"award-info":[{"award-number":["71701162"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["XJS190602"],"award-info":[{"award-number":["XJS190602"]}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2019JQ-079"],"award-info":[{"award-number":["2019JQ-079"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2019JQ-154"],"award-info":[{"award-number":["2019JQ-154"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2017M613192"],"award-info":[{"award-number":["2017M613192"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11590-020-01597-w","type":"journal-article","created":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T16:51:46Z","timestamp":1589820706000},"page":"733-755","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multiple sink location problem in path networks with a combinational objective"],"prefix":"10.1007","volume":"15","author":[{"given":"Taibo","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongmei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaofeng","family":"Ru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weitian","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,18]]},"reference":[{"issue":"9","key":"1597_CR1","doi-asserted-by":"publisher","first-page":"3534","DOI":"10.1007\/s00453-019-00589-2","volume":"81","author":"GP Arumugam","year":"2019","unstructured":"Arumugam, G.P., Augustine, J., Golin, M.J., Strikanthan, P.: Minmax regret $$k$$-sink location on a dynamic path network with uniform capacities. Algorithmica 81(9), 3534\u20133585 (2019)","journal-title":"Algorithmica"},{"issue":"2","key":"1597_CR2","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.tcs.2019.05.047","volume":"806","author":"R Benkoczi","year":"2020","unstructured":"Benkoczi, R., Bhattacharya, B., Higashikawa, Y., Kameda, T., Katoh, N.: Minsum k-sink problem on path networks. Theor. Comput. Sci. 806(2), 388\u2013401 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1597_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1057\/jors.1991.69","volume":"42","author":"O Berman","year":"1991","unstructured":"Berman, O., Yang, E.K.: Medi-centre location problems. J. Oper. Res. Soc. 42(4), 313\u2013322 (1991)","journal-title":"J. Oper. Res. Soc."},{"key":"1597_CR4","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B., Golin, M.J., Higashikawa, Y., Kameda, T., Katoh, N.: Improved algorithms for computing $$k$$-sink on dynamic flow path networks. In: Proceedings of the 15th International Symposium, Workshop on Algorithms and Data Structures (WADS), LNCS, vol. 10389, pp. 133\u2013144 (2017)","DOI":"10.1007\/978-3-319-62127-2_12"},{"key":"1597_CR5","unstructured":"Bhattacharya, B., Higashikawa, Y., Kameda, T., Katoh, N.: Minmax regret 1-sink for aggregate evacuation time on path networks. arXiv:1806.00814v1 (2018)"},{"issue":"p3","key":"1597_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.tcs.2015.07.009","volume":"607","author":"B Bhattacharya","year":"2015","unstructured":"Bhattacharya, B., Kameda, T.: Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. Theor. Comput. Sci. 607(p3), 411\u2013425 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"1597_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Higashikawa, Y., Katoh, N., Ni, G., Su, B., Xu, Y.: Minimax regret 1-sink location problems in dynamic path networks. In: Proceedings of the 10th Annual Conference on Theory and Applications of Models of Computation (TAMC), LNCS, vol. 7876, pp. 121\u2013132 (2013)","DOI":"10.1007\/978-3-642-38236-9_12"},{"issue":"3","key":"1597_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"JL Ford","year":"1958","unstructured":"Ford, J.L., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419\u2013433 (1958)","journal-title":"Oper. Res."},{"key":"1597_CR9","unstructured":"Golin, M.J., Sandeep, S.: Minmax-regret $$k$$-sink location on a dynamic tree network with uniform capacities. arXiv:1806.03814 (2018)"},{"issue":"2","key":"1597_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1111\/j.1467-9787.1976.tb00966.x","volume":"16","author":"J Halpern","year":"1976","unstructured":"Halpern, J.: The location of a center-median convex combination on an undirected tree. J. Reg. Sci. 16(2), 237\u2013245 (1976)","journal-title":"J. Reg. Sci."},{"issue":"5","key":"1597_CR11","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/mnsc.24.5.535","volume":"24","author":"J Halpern","year":"1978","unstructured":"Halpern, J.: Finding minimal center-median convex combination (cent-dian) of a graph. Manag. Sci. 24(5), 534\u2013544 (1978)","journal-title":"Manag. Sci."},{"issue":"11","key":"1597_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.tcs.2014.02.010","volume":"588","author":"Y Higashikawa","year":"2015","unstructured":"Higashikawa, Y., Augustine, J., Cheng, S.W., Golin, M.J., Katoh, N., Ni, G., Su, B., Xu, Y.: Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. 588(11), 24\u201336 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"1597_CR13","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1007\/s00224-017-9783-8","volume":"62","author":"Y Higashikawa","year":"2018","unstructured":"Higashikawa, Y., Cheng, S.W., Kameda, T., Katoh, N., Saburi, S.: Minimax regret 1-median problem in dynamic path networks. Theory Comput. Syst. 62(6), 1392\u20131408 (2018)","journal-title":"Theory Comput. Syst."},{"key":"1597_CR14","doi-asserted-by":"crossref","unstructured":"Higashikawa, Y., Golin, M.J., Katoh, N.: Minimax regret sink location problem in dynamic tree networks with uniform capacity. In: Proceedings of the 8th International Workshop on Algorithms and Computation (WALCOM), LNCS, vol. 8344, pp. 125\u2013137 (2014)","DOI":"10.1007\/978-3-319-04657-0_14"},{"key":"1597_CR15","doi-asserted-by":"crossref","unstructured":"Higashikawa, Y., Golin, M.J., Katoh, N.: Multiple sink location problems in dynamic path networks. In: Proceedings of the 10th International Conference on Algorithmic Aspects of Information and Management (AAIM), LNCS, vol. 8546, pp. 149\u2013161 (2014)","DOI":"10.1007\/978-3-319-07956-1_14"},{"issue":"1","key":"1597_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2015.05.053","volume":"607","author":"Y Higashikawa","year":"2015","unstructured":"Higashikawa, Y., Golin, M.J., Katoh, N.: Multiple sink location problems in dynamic path networks. Theor. Comput. Sci. 607(1), 2\u201315 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1597_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1287\/opre.39.1.100","volume":"39","author":"JN Hooker","year":"1991","unstructured":"Hooker, J.N., Garfinkel, R.S., Chen, C.: Finite dominating sets for network location problems. Oper. Res. 39(1), 100\u2013118 (1991)","journal-title":"Oper. Res."},{"issue":"2","key":"1597_CR18","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2015.09.022","volume":"250","author":"H Li","year":"2016","unstructured":"Li, H., Xu, Y.: Minimax regret 1-sink location problem with accessibility in dynamic general networks. Eur. J. Oper. Res. 250(2), 360\u2013366 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1597_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10878-014-9716-2","volume":"31","author":"H Li","year":"2016","unstructured":"Li, H., Xu, Y., Ni, G.: Minimax regret vertex 2-sink location problem in dynamic path networks. J. Comb. Optim. 31(1), 79\u201394 (2016)","journal-title":"J. Comb. Optim."},{"issue":"5","key":"1597_CR20","first-page":"1020","volume":"85","author":"S Mamada","year":"2002","unstructured":"Mamada, S., Makino, K., Fujishige, S.: Optimal sink location problem for dynamic flows in a tree network. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85(5), 1020\u20131025 (2002)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"16","key":"1597_CR21","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 ^{2}n)$$ algorithm for the optimal sink location problem in dynamic tree networks. Discrete Appl. Math. 154(16), 2387\u20132401 (2006)","journal-title":"Discrete Appl. Math."},{"key":"1597_CR22","doi-asserted-by":"crossref","unstructured":"Ni, G., Xu, Y., Dong, Y.: Minimax regret $$k$$-sink location problem in dynamic path networks. In: Proceedings of the 10th International Conference on Algorithmic Aspects of Information and Management (AAIM), LNCS, vol. 8546, pp. 23\u201331 (2014)","DOI":"10.1007\/978-3-319-07956-1_3"},{"issue":"6","key":"1597_CR23","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"CR Toregas","year":"1971","unstructured":"Toregas, C.R., Swain, R., Bergman, L.: The location of emergency service facilities. Oper. Res. 19(6), 1363\u20131373 (1971)","journal-title":"Oper. Res."},{"issue":"3","key":"1597_CR24","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2014.06.026","volume":"239","author":"H Wang","year":"2014","unstructured":"Wang, H.: Minmax regret 1-facility location on uncertain path networks. Eur. J. Oper. Res. 239(3), 636\u2013643 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1597_CR25","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.ipl.2014.09.006","volume":"115","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Li, H.: Minimax regret 1-sink location problem in dynamic cycle networks. Inf. Process. Lett. 115(2), 163\u2013169 (2015)","journal-title":"Inf. Process. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01597-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01597-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01597-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:01:32Z","timestamp":1621296092000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01597-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,18]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1597"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01597-w","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,18]]},"assertion":[{"value":"30 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}