{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:03:56Z","timestamp":1742969036414,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_25","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two Paths Location of a Tree with Positive or Negative Weights"],"prefix":"10.1007","author":[{"given":"Jianjie","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Liying","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Erfang","family":"Shan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s10878-012-9558-8","volume":"28","author":"A Armon","year":"2014","unstructured":"Armon, A., Gamzu, I., Segev, D.: Mobile facility location: combinatorial filtering via weighted occupancy. J. Comb. Optim. 28, 358\u2013375 (2014)","journal-title":"J. Comb. Optim."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0166-218X(85)80002-0","volume":"11","author":"RI Becker","year":"1985","unstructured":"Becker, R.I., Perl, Y.: Finding the two-core of a tree. Discrete Appl. Math. 11, 103\u2013113 (1985)","journal-title":"Discrete Appl. Math."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-006-0162-0","volume":"150","author":"RI Becker","year":"2001","unstructured":"Becker, R.I., Lari, I., Scozzari, A., Storchi, G.: The location of median paths on grid graphs. Ann. Oper. Res. 150, 65\u201378 (2001)","journal-title":"Ann. Oper. Res."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1016\/j.ejor.2005.09.049","volume":"179","author":"RI Becker","year":"2007","unstructured":"Becker, R.I., Lari, I., Scozzari, A.: Algorithms for central-median paths with bounded length on trees. Eur. J. Oper. Res. 179, 1208\u20131220 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1287\/opre.1060.0348","volume":"55","author":"O Berman","year":"2007","unstructured":"Berman, O., Krass, D., Menezes, M.: Facility reliability issues in network $$p$$-median problems: strategic centralization and co-location effects. Oper. Res. 55, 332\u2013350 (2007)","journal-title":"Oper. Res."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0166-218X(00)00177-3","volume":"60","author":"RE Burkard","year":"2000","unstructured":"Burkard, R.E., Cela, E., Dollani, H.: $$2$$-medians in trees with pos\/neg-weights. Discrete Appl. Math. 60, 51\u201371 (2000)","journal-title":"Discrete Appl. Math."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10878-008-9187-4","volume":"20","author":"RE Burkard","year":"2010","unstructured":"Burkard, R.E., Hatzl, J.: Median problems with positive and negative weights on cycles and cacti. J. Comb. Optim. 20, 27\u201346 (2010)","journal-title":"J. Comb. Optim."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10878-008-9162-0","volume":"19","author":"S Elloumi","year":"2010","unstructured":"Elloumi, S.: A tighter formulation of the $$p$$-median problem. J. Comb. Optim. 19, 69\u201383 (2010)","journal-title":"J. Comb. Optim."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"AJ Goldman","year":"1971","unstructured":"Goldman, A.J.: Optimal center location in simple networks. Trans. Sci. 5, 212\u2013221 (1971)","journal-title":"Trans. Sci."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I: The $$p$$-centers. SIAM J. Appl. Math. 37, 513\u2013518 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part II: The $$p$$-medians. SIAM J. Appl. Math. 37, 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2007.07.001","volume":"190","author":"I Lari","year":"2008","unstructured":"Lari, I., Ricca, F., Scozzari, A.: Comparing different metaheuristic approaches for the median path problem with bounded length. Eur. J. Oper. Res. 190, 587\u2013597 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"CA Morgan","year":"1980","unstructured":"Morgan, C.A., Slater, P.J.: A linear algorithm for the core of a tree. J. Algorithms 1, 247\u2013258 (1980)","journal-title":"J. Algorithms"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.20284","volume":"53","author":"J Peurto","year":"2009","unstructured":"Peurto, J., Ricca, F., Scozzari, A.: The continuous and discrete path-variance problems on trees. Networks 53, 221\u2013228 (2009)","journal-title":"Networks"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1016\/j.dam.2008.03.035","volume":"157","author":"J Peurto","year":"2009","unstructured":"Peurto, J., Ricca, F., Scozzari, A.: Extensive facility location problems on networks with equity measures. Discrete Appl. Math. 157, 1069\u20131085 (2009)","journal-title":"Discrete Appl. Math."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.disopt.2014.01.003","volume":"12","author":"J Peurto","year":"2014","unstructured":"Peurto, J., Ricca, F., Scozzari, A.: Reliability problems in multiple path-shaped facility location. Discrete Optim. 12, 61\u201372 (2014)","journal-title":"Discrete Optim."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/net.3230200404","volume":"20","author":"MB Richey","year":"1990","unstructured":"Richey, M.B.: Optimal location of a path or tree on a network with cycles. Networks 20, 391\u2013407 (1990)","journal-title":"Networks"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"PJ Slater","year":"1982","unstructured":"Slater, P.J.: Locating central paths in a graph. Transp. Sci. 16, 1\u201318 (1982)","journal-title":"Transp. Sci."},{"key":"25_CR19","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.: An $$O(pn^{2})$$ algorithm for the $$p$$-median and related problems on tree graphs. Oper. Res. Lett. 19, 59\u201364 (1996)","journal-title":"Oper. Res. Lett."},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/S0895480100374242","volume":"15","author":"F Wang","year":"2002","unstructured":"Wang, F.: Finding a two-core of a tree in linear time. SIAM J. Discrete Math. 15, 193\u2013210 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR21","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.: Finding a core of a tree with pos\/neg weight. Math. Meth. Oper. Res. 76, 147\u2013160 (2012)","journal-title":"Math. Meth. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T14:26:50Z","timestamp":1675348010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}