{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:09Z","timestamp":1740108249305,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T00:00:00Z","timestamp":1540512000000},"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":["Math Meth Oper Res"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00186-018-0651-3","type":"journal-article","created":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T05:47:16Z","timestamp":1540532836000},"page":"115-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding an optimal core on a tree network with M\/G\/c\/c state-dependent queues"],"prefix":"10.1007","volume":"89","author":[{"given":"Mehrdad","family":"Moshtagh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1397-8529","authenticated-orcid":false,"given":"Jafar","family":"Fathali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James MacGregor","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nezam","family":"Mahdavi-Amiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,26]]},"reference":[{"key":"651_CR1","unstructured":"Alstrup S, Lauridsen PW, Sommerlund P, Thorup M (2001) Finding cores of limited length, IT-C technical report series 2000\u20134, University of Copenhagen"},{"key":"651_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10589-005-4800-2","volume":"32","author":"P Avella","year":"2005","unstructured":"Avella P, Boccia M, Sforza A, Vasil\u2019Ev I (2005) A branch-and-cut algorithm for the median-path problem. Comput Optim Appl 32:215\u2013230","journal-title":"Comput Optim Appl"},{"key":"651_CR3","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1016\/S0305-0548(99)00042-8","volume":"26","author":"I Averbakh","year":"1999","unstructured":"Averbakh I, Berman O (1999) Algorithms for path medi-centers of a tree network. Comput Oper Res 26:1395\u20131409","journal-title":"Comput Oper Res"},{"key":"651_CR4","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1287\/opre.37.4.648","volume":"37","author":"R Batta","year":"1989","unstructured":"Batta R (1989) The stochastic queue median over a finite discrete set. Oper Res 37:648\u2013652","journal-title":"Oper Res"},{"key":"651_CR5","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1002\/net.3230190609","volume":"19","author":"R Batta","year":"1989","unstructured":"Batta R, Berman O (1989) A location model for a facility operating as an M\/G\/k queue. Networks 19:717\u2013728","journal-title":"Networks"},{"key":"651_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0166-218X(01)00254-2","volume":"118","author":"RI Becker","year":"2002","unstructured":"Becker RI, Chang Y, Lari I, Scozzari A, Storchi G (2002) Finding the \n                    \n                      \n                    \n                    $$l$$\n                    \n                      \n                        l\n                      \n                    \n                  -core of a tree. Discrete Appl Math 118:25\u201342","journal-title":"Discrete Appl Math"},{"key":"651_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1057\/palgrave.jors.2602126","volume":"58","author":"O Berman","year":"2007","unstructured":"Berman O, Drezner Z (2007) The multiple server location problems. Oper Res Soc 58:91\u201399","journal-title":"Oper Res Soc"},{"key":"651_CR8","doi-asserted-by":"crossref","unstructured":"Berman O, Krass D (2002) Facility location problems with stochastic demands and congestion. In: Drezner Z, Hamacher H (eds) Facility location: applications and theory. Springer, Berlin, pp 329\u2013371","DOI":"10.1007\/978-3-642-56082-8_11"},{"key":"651_CR9","unstructured":"Berman O, Larson RC (1978) The congested median problem. Operations research center working paper, OR, 076-78"},{"key":"651_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0305-0548(82)90010-7","volume":"9","author":"O Berman","year":"1982","unstructured":"Berman O, Larson RC (1982) The median problem with congestion. Comput Oper Res 9:119\u2013126","journal-title":"Comput Oper Res"},{"key":"651_CR11","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/0377-2217(86)90185-2","volume":"26","author":"O Berman","year":"1986","unstructured":"Berman O, Mandowsky R (1986) Location-allocation on congested networks. Eur J Oper Res 26:238\u2013250","journal-title":"Eur J Oper Res"},{"key":"651_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF01189246","volume":"15","author":"J Cheah","year":"1994","unstructured":"Cheah J, Smith JM (1994) Generalized M\/G\/c\/c state dependent queueing models and pedestrian traffic flow. Queueing Syst 15:365\u2013386","journal-title":"Queueing Syst"},{"key":"651_CR13","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/mnsc.31.6.764","volume":"31","author":"SS Chiu","year":"1985","unstructured":"Chiu SS, Berman O, Larson RC (1985) Locating a mobile server queuing facility on a tree network. Manag Sci 31:764\u2013772","journal-title":"Manag Sci"},{"key":"651_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/net.3230260413","volume":"26","author":"B Gavish","year":"1995","unstructured":"Gavish B, Sridhar S (1995) Computing the 2-median on tree network is O(nlogn) time. Networks 26:305\u2013317","journal-title":"Networks"},{"key":"651_CR15","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":"651_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/trsc.15.2.98","volume":"15","author":"SM Hedetniemi","year":"1981","unstructured":"Hedetniemi SM, Cockaine EJ, Hedetniemi ST (1981) Linear algorithms for finding the Jordan center and path center of a tree. Transp Sci 15:98\u2013114","journal-title":"Transp Sci"},{"key":"651_CR17","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1287\/trsc.31.4.324","volume":"4","author":"R Jain","year":"1997","unstructured":"Jain R, Smith JM (1997) Modeling vehicular traffic flow using M\/G\/c\/c state dependent queueing models. Transp Sci 4:324\u2013336","journal-title":"Transp Sci"},{"key":"651_CR18","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 2. The p-medians. SIAM J Appl Math 37:539\u2013560","journal-title":"SIAM J Appl Math"},{"key":"651_CR19","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/opre.9.3.383","volume":"9","author":"JDC Little","year":"1961","unstructured":"Little JDC (1961) A proof for the queuing formula: \n                    \n                      \n                    \n                    $$L=\\lambda $$\n                    \n                      \n                        \n                          L\n                          =\n                          \u03bb\n                        \n                      \n                    \n                  W. Oper Res 9:383\u2013387","journal-title":"Oper Res"},{"key":"651_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0191-2615(99)00039-9","volume":"35","author":"DH Mitchell","year":"2001","unstructured":"Mitchell DH, Smith JM (2001) Topological network design of pedestrian networks. Transp Res Part B 35:107\u2013135","journal-title":"Transp Res Part B"},{"key":"651_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"CA Morgan","year":"1980","unstructured":"Morgan CA, Slater PJ (1980) A linear algorithm for a core of a tree. J Algorithms 1:247\u2013258","journal-title":"J Algorithms"},{"issue":"2","key":"651_CR22","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.ejor.2018.02.026","volume":"269","author":"M Moshtagh","year":"2018","unstructured":"Moshtagh M, Fathali J, Smith JM (2018) The stochastic queue core problem, evacuation network, and state-dependent queues. Eur J Oper Res 269(2):730\u2013748","journal-title":"Eur J Oper Res"},{"key":"651_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"PJ Slater","year":"1982","unstructured":"Slater PJ (1982) Locating central paths in a graph. Transp Sci 16:1\u201318","journal-title":"Transp Sci"},{"key":"651_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A Tamir","year":"1996","unstructured":"Tamir A (1996) An \n                    \n                      \n                    \n                    $$O(pn^2)$$\n                    \n                      \n                        \n                          O\n                          (\n                          p\n                          \n                            n\n                            2\n                          \n                          )\n                        \n                      \n                    \n                   algorithm for the p-median and related problems on tree graphs. Oper Res Lett 19:59\u201364","journal-title":"Oper Res Lett"},{"key":"651_CR25","volume-title":"The design of interior circulation","author":"PR Tregenza","year":"1976","unstructured":"Tregenza PR (1976) The design of interior circulation. Van Nostrand Reinhold Company, New York"},{"key":"651_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1020961732667","volume":"111","author":"Q Wang","year":"2002","unstructured":"Wang Q, Batta R, Rump CM (2002) Algorithms for a facility location problem with stochastic customer demand and immobile servers. Ann Oper Res 111:17\u201334","journal-title":"Ann Oper Res"},{"key":"651_CR27","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF01159471","volume":"4","author":"S Yuhaski","year":"1989","unstructured":"Yuhaski S, Smith JM (1989) Modeling circulation systems in buildings using state dependent models. Queuing Syst 4:319\u2013338","journal-title":"Queuing Syst"},{"key":"651_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00186-012-0394-5","volume":"76","author":"M Zaferanieh","year":"2012","unstructured":"Zaferanieh M, Fathali J (2012) Finding a core of a tree with pos\/neg weight. Math Methods Oper Res 76:147\u2013160","journal-title":"Math Methods Oper Res"},{"key":"651_CR29","unstructured":"Zaferanieh M, Fathali J (2017) The stochastic queue core problem on a tree. \n                    arXiv:1701.01812\n                    \n                   [math.OC]"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-018-0651-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0651-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0651-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T21:00:07Z","timestamp":1572037207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-018-0651-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,26]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s00186-018-0651-3","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2018,10,26]]},"assertion":[{"value":"11 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}