{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:01Z","timestamp":1740122401219,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10878-024-01113-1","type":"journal-article","created":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T12:01:27Z","timestamp":1712404887000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the expense transmission time from the source node to demand nodes"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8357-7857","authenticated-orcid":false,"given":"Mehdi","family":"Ghiyasvand","sequence":"first","affiliation":[]},{"given":"Iman","family":"Keshtkar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,6]]},"reference":[{"key":"1113_CR1","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1134\/S1990478908030022","volume":"2","author":"AA Ageev","year":"2008","unstructured":"Ageev AA (2008) Metric location problems with nonshortest service routes. J Appl Ind Math 2:311\u2013316","journal-title":"J Appl Ind Math"},{"key":"1113_CR2","doi-asserted-by":"crossref","unstructured":"Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V (2001) Local search heuristics for k-median and facility location problems, In: Proceedings of the ACM symposium on theory of computing, pp 21-29","DOI":"10.1145\/380752.380755"},{"key":"1113_CR3","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.comgeo.2008.04.004","volume":"42","author":"R Benkoczi","year":"2009","unstructured":"Benkoczi R, Bhattacharya B, Das S, Sember J (2009) Single facility collection problem in the plane. Comput Geom 42:403\u2013418","journal-title":"Comput Geom"},{"key":"1113_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"Y Chen","year":"1990","unstructured":"Chen Y, Chin Y (1990) The quickest path problem. Comput Oper Res 17:153\u2013161","journal-title":"Comput Oper Res"},{"key":"1113_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(93)90057-G","volume":"46","author":"G-H Chen","year":"1993","unstructured":"Chen G-H, Hung Y-C (1993) On the quickest path problem. Inf Process Lett 46:125\u2013128","journal-title":"Inf Process Lett"},{"key":"1113_CR6","volume-title":"Network and discrete location: models, algorithms, and applications","author":"MS Daskin","year":"2011","unstructured":"Daskin MS (2011) Network and discrete location: models, algorithms, and applications. John Wiley and Sons, USA"},{"key":"1113_CR7","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"AJ Goldman","year":"1971","unstructured":"Goldman AJ (1971) Optimal center location in simple networks. Transp Sci 5:212\u2013221","journal-title":"Transp Sci"},{"key":"1113_CR8","volume-title":"Facility location: applications and theory","author":"HW Hamacher","year":"2002","unstructured":"Hamacher HW, Drezner Z (2002) Facility location: applications and theory. Springer Science and Business Media, Germany"},{"key":"1113_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"GY Handler","year":"1973","unstructured":"Handler GY (1973) Minimax location of a facility in an undirected tree graph. Transp Sci 7:287\u2013293","journal-title":"Transp Sci"},{"key":"1113_CR10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems, part I: p-centers. SIAM J Appl Math 37:513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"1113_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems, part II: p-medians. SIAM J Appl Math 37:539\u2013560","journal-title":"SIAM J Appl Math"},{"key":"1113_CR12","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.dam.2019.01.001","volume":"260","author":"I Keshtkar","year":"2019","unstructured":"Keshtkar I, Ghiyasvand M (2019) Inverse quickest center location problem on a tree. Discret Appl Math 260:188\u2013202","journal-title":"Discret Appl Math"},{"key":"1113_CR13","volume-title":"Introduction to location science in location science","author":"G Laporte","year":"2015","unstructured":"Laporte G, Nickel S, da Gama FS (2015) Introduction to location science in location science. Springer, Germany"},{"key":"1113_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo N (1983) Linear-time algorithms for linear programming in $$R^{3}$$ and related problems. SIAM J Comput 12:759\u2013776","journal-title":"SIAM J Comput"},{"volume-title":"Discrete Location Theory","year":"1990","key":"1113_CR15","unstructured":"Mirchandani PB, Francis RL (eds) (1990) Discrete Location Theory. Wiley, New York"},{"key":"1113_CR16","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G Nagy","year":"2007","unstructured":"Nagy G, Salhia S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:649\u2013672","journal-title":"Eur J Oper Res"},{"key":"1113_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1080\/02331934.2014.994626","volume":"65","author":"KT Nguyen","year":"2015","unstructured":"Nguyen KT (2015) Reverse 1-center problem on weighted trees. Optimization 65:253\u2013264","journal-title":"Optimization"},{"key":"1113_CR18","first-page":"501","volume":"24","author":"KT Nguyen","year":"2020","unstructured":"Nguyen KT (2020) Inverse Anti-centrum problem on networks with variable edge lengths. Taiwan J Math 24:501\u2013522","journal-title":"Taiwan J Math"},{"key":"1113_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00186-015-0502-4","volume":"82","author":"KT Nguyen","year":"2015","unstructured":"Nguyen KT, Anh LQ (2015) Inverse k-centrum problem on trees with variable vertex weights. Math Methods Oper Res 82:19\u201330","journal-title":"Math Methods Oper Res"},{"key":"1113_CR20","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10100-014-0367-2","volume":"23","author":"KT Nguyen","year":"2015","unstructured":"Nguyen KT, Chassein A (2015) Inverse eccentric vertex problem on networks. CEJOR 23:687\u2013698","journal-title":"CEJOR"},{"key":"1113_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00186-018-0632-6","volume":"88","author":"KT Nguyen","year":"2018","unstructured":"Nguyen KT, Nguyen-Thu A, Hung NT (2018) On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks. Math Methods Oper Res 88:147\u2013159","journal-title":"Math Methods Oper Res"},{"key":"1113_CR22","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2019108","author":"KT Nguyen","year":"2019","unstructured":"Nguyen KT, Hieu VNM, Pham VH (2019) Inverse group 1-median problem on trees. J Ind Manag Optim. https:\/\/doi.org\/10.3934\/jimo.2019108","journal-title":"J Ind Manag Optim"},{"key":"1113_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(03)00402-X","volume":"312","author":"S Pettie","year":"2004","unstructured":"Pettie S (2004) A new approach to all-pairs shortest paths on real-weighted graphs. Theor Comput Sci 312:47\u201374","journal-title":"Theor Comput Sci"},{"key":"1113_CR24","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1137\/S0097539702419650","volume":"54","author":"S Pettie","year":"2005","unstructured":"Pettie S, Ramachandran V (2005) A shortest path algorithm for real-weighted undirected graphs. SIAM J Comput 54:1398\u20131431","journal-title":"SIAM J Comput"},{"key":"1113_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tcs.2019.05.039","volume":"795","author":"VH Pham","year":"2019","unstructured":"Pham VH, Nguyen KT (2019) Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms. Theoret Comput Sci 795:119\u2013127","journal-title":"Theoret Comput Sci"},{"key":"1113_CR26","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.disopt.2004.12.004","volume":"2","author":"A Tamir","year":"2005","unstructured":"Tamir A, Halman N (2005) One-way and round-trip center location problems. Discrete Optim 2:168\u2013184","journal-title":"Discrete Optim"},{"key":"1113_CR27","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.jcss.2016.01.002","volume":"82","author":"BF Wang","year":"2016","unstructured":"Wang BF, Ye JH, Chen PJ (2016) Efficent algorithms for the round-trip 1-center and 1-median problems. J Comput Syst Sci 82:782\u2013792","journal-title":"J Comput Syst Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01113-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01113-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01113-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T19:06:36Z","timestamp":1713985596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01113-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1113"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01113-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"9 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"47"}}