{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:40:07Z","timestamp":1747579207732,"version":"3.40.5"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1026154708960","type":"journal-article","created":{"date-parts":[[2003,11,3]],"date-time":"2003-11-03T22:50:32Z","timestamp":1067899832000},"page":"219-232","source":"Crossref","is-referenced-by-count":9,"title":["Bi-Objective Median Subtree Location Problems"],"prefix":"10.1007","volume":"122","author":[{"given":"J.W.","family":"George","sequence":"first","affiliation":[]},{"given":"C.S.","family":"ReVelle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"5143615_CR1","first-page":"319","volume":"30","author":"Y.P. Aneja","year":"1992","unstructured":"Aneja, Y.P. and K.P.K. Nair. (1992). \u201cLocation of a Tree Shaped Facility in a Network.\u201d INFOR 30(4), 319\u2013324.","journal-title":"INFOR"},{"issue":"1","key":"5143615_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0305-0548(00)00051-4","volume":"29","author":"G. Bruno","year":"2002","unstructured":"Bruno, G., M. Gendreau, and G. Laporte. (2002a). Computers and Operations Research 29(1), 1\u201312.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"5143615_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0305-0548(00)00051-4","volume":"21","author":"G. Bruno","year":"2002","unstructured":"Bruno, G., M. Gendreau, and G. Laporte. (2002b). \u201cA Heuristic for the Location of a Rapid Transit Line.\u201d Computers and Operations Research 21(1), 1\u201312.","journal-title":"Computers and Operations Research"},{"key":"5143615_CR4","unstructured":"Church, R.L. and J.R. Current. (1989). \u201cMaximal Covering Tree Problems.\u201d Working Paper Series, WPS 89\u201347, College of Business, Ohio State University, July."},{"key":"5143615_CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/1520-6750(199302)40:1<129::AID-NAV3220400109>3.0.CO;2-T","volume":"40","author":"R.L. Church","year":"1993","unstructured":"Church, R.L. and J.R. Current. (1993). \u201cMaximal Covering Tree Problems.\u201d Naval Research Logistics 40, 129\u2013142.","journal-title":"Naval Research Logistics"},{"key":"5143615_CR6","volume-title":"Multiobjective Programming and Planning","author":"J.L. Cohon","year":"1978","unstructured":"Cohon, J.L. (1978). Multiobjective Programming and Planning. New York: Academic Press."},{"issue":"3","key":"5143615_CR7","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"J.R. Current","year":"1989","unstructured":"Current, J.R. and D.A. Schilling. (1989). \u201cThe Covering Salesman Problem.\u201d Transportation Science 23(3), 208\u2013213.","journal-title":"Transportation Science"},{"key":"5143615_CR8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","volume":"73","author":"J.R. Current","year":"1994","unstructured":"Current, J.R. and D.A. Schilling. (1994). \u201cThe Median Tour and Maximal Covering Tour Problems: Formulations and Heuristics.\u201d European Journal of Operational Research 73, 114\u2013126.","journal-title":"European Journal of Operational Research"},{"key":"5143615_CR9","first-page":"24","volume-title":"Proceedings of an International Conference on Genetic Algorithms and their Applications","author":"K. De Jong","year":"1985","unstructured":"De Jong, K. (1985). \u201cGenetic Algorithms: A Ten-Year Perspective.\u201d In J.J. Grefenstette (ed.), Proceedings of an International Conference on Genetic Algorithms and their Applications, Carnegie-Mellon University, Pittsburg, PA, July 24\u201325, 1985. Hillsdale, NJ: Lawrence Erbaum Associates."},{"key":"5143615_CR10","unstructured":"George, J.W. (1997). \u201cSubtree Location on Tree Networks Applied to Transportation and Telecommunications Network Design.\u201d A Dissertation, Department of Geography and Environmental Engineering, Whiting School of Engineering, Johns Hopkins University."},{"key":"5143615_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1020719718071","volume":"110","author":"J.W. George","year":"2002","unstructured":"George, J.W., C.S. ReVelle, and J.R. Current. (2002). \u201cThe Maximum Utilization Subtree Problem.\u201d Annals of Operations Research 110, 133\u2013151.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"5143615_CR12","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F. (1986). \u201cFuture Paths for Integer Programming and Links to Artificial Intelligence.\u201d Computers and Operations Research 13(5), 533\u2013549.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"5143615_CR13","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). \u201cTabu Search: A Tutorial.\u201d Interfaces 20(4), 74\u201394.","journal-title":"Interfaces"},{"key":"5143615_CR14","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A.J. Goldman","year":"1971","unstructured":"Goldman, A.J. (1971). \u201cOptimal Center Location in Simple Networks.\u201d Transportation Science 5, 212\u2013221.","journal-title":"Transportation Science"},{"key":"5143615_CR15","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1002\/net.3230230605","volume":"23","author":"S.L. Hakimi","year":"1993","unstructured":"Hakimi, S.L., E.F. Schmeichel, and M. Labbe. (1993). \u201cOn Locating Path-or Tree-Shaped Facilities on Networks.\u201d Networks 23, 543\u2013555.","journal-title":"Networks"},{"key":"5143615_CR16","series-title":"RUTCOR Research Report","volume-title":"Algorithms for the Maximum Satisfiability Problem","author":"P. Hansen","year":"1987","unstructured":"Hansen, P. and B. Jaumard. (1987). \u201cAlgorithms for the Maximum Satisfiability Problem.\u201d RUTCOR Research Report 43\u201387, Rutgers University, New Brunswick, NJ."},{"issue":"2","key":"5143615_CR17","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/trsc.15.2.98","volume":"15","author":"S.M. Hedetniemi","year":"1981","unstructured":"Hedetniemi, S.M., E.J. Cockayne, and S.T. Hedetniemi. (1981). \u201cLinear Algorithms for Finding the Jordan Center and Path Center of a Tree.\u201d Transportation Science 15(2), 98\u2013114.","journal-title":"Transportation Science"},{"key":"5143615_CR18","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press, 183 pp."},{"key":"5143615_CR19","first-page":"77","volume":"2","author":"L.K. Hua","year":"1962","unstructured":"Hua, L.K. et al. (1962). \u201cApplications of Mathematical Models toWheat Harvesting.\u201d Chin.Math. 2, 77\u201391.","journal-title":"Chin.Math."},{"issue":"4","key":"5143615_CR20","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/trsc.23.4.288","volume":"23","author":"V.A. Hutson","year":"1989","unstructured":"Hutson, V.A. and C.S. ReVelle. (1989). \u201cMaximal Direct Covering Tree Problems.\u201d Transportation Science 23(4), 288\u2013299.","journal-title":"Transportation Science"},{"key":"5143615_CR21","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0377-2217(93)90141-9","volume":"65","author":"V.A. Hutson","year":"1993","unstructured":"Hutson, V.A. and C.S. ReVelle. (1993). \u201cIndirect Covering Tree Problems on Spanning Tree Networks.\u201d European Journal of Operational Research 65, 20\u201332.","journal-title":"European Journal of Operational Research"},{"key":"5143615_CR22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<167::AID-NET5>3.0.CO;2-L","volume":"28","author":"T.U. Kim","year":"1996","unstructured":"Kim, T.U., T.J. Lowe, A. Tarmir, and J.E. Wang. (1996). \u201cOn the Location of a Tree-Shaped Facility.\u201d Networks 28, 167\u2013175.","journal-title":"Networks"},{"key":"5143615_CR23","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02097806","volume":"18","author":"T.U. Kim","year":"1989","unstructured":"Kim, T.U., T.J. Lowe, J.E. Ward, and R.L Francis. (1989). \u201cA Minimal Length Covering Subgraph of a Network.\u201d Annals of Operations Research 18, 245\u2013260.","journal-title":"Annals of Operations Research"},{"key":"5143615_CR24","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/1520-6750(199004)37:2<309::AID-NAV3220370209>3.0.CO;2-8","volume":"37","author":"T.U. Kim","year":"1990","unstructured":"Kim, T.U., T.J. Lowe, J.E. Ward, and R.L Francis. (1990). \u201cA Minimal Length Covering Subtree of a Tree.\u201d Naval Research Logistics 37, 309\u2013326.","journal-title":"Naval Research Logistics"},{"issue":"2","key":"5143615_CR25","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0305-0548(88)90003-2","volume":"15","author":"R.K. Kincaid","year":"1988","unstructured":"Kincaid, R.K., T.J. Lowe, and T.L. Morin. (1988). \u201cThe Location of Central Structures in Trees.\u201d Computers and Operations Research 15(2), 103\u2013113.","journal-title":"Computers and Operations Research"},{"key":"5143615_CR26","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/0377-2217(95)00321-5","volume":"95","author":"J.A. Mesa","year":"1996","unstructured":"Mesa, J.A. and T.B. Boffey. (1996). \u201cA Review of Extensive Facility Location in Networks.\u201d European Jornal of Operational Research 95, 592\u2013603.","journal-title":"European Jornal of Operational Research"},{"key":"5143615_CR27","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.3230150304","volume":"15","author":"E. Minieka","year":"1985","unstructured":"Minieka, E. (1985). \u201cThe Optimal Location of a Path or Tree in a Tree Network.\u201d Networks 15, 309\u2013321.","journal-title":"Networks"},{"key":"5143615_CR28","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0196-6774(83)90015-9","volume":"4","author":"E. Minieka","year":"1983","unstructured":"Minieka, E. and N.H. Patel. (1983). \u201cOn Finding the Core of a Tree with a Specified Length.\u201d Journal of Algorithms 4, 345\u2013352.","journal-title":"Journal of Algorithms"},{"key":"5143615_CR29","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"C.A. Morgan","year":"1980","unstructured":"Morgan, C.A. and P.J. Slater. (1980). \u201cA Linear Algorithm for a Core of a Tree.\u201d Journal of Algorithms 1, 247\u2013258.","journal-title":"Journal of Algorithms"},{"key":"5143615_CR30","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/jagm.1993.1034","volume":"15","author":"S. Peng","year":"1993","unstructured":"Peng, S., A.B. Stephens, and Y. Yesha. (1993). \u201cAlgorithms for a Core and k-Tree Core of a Tree.\u201d Journal of Algorithms 15, 143\u2013159.","journal-title":"Journal of Algorithms"},{"key":"5143615_CR31","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1006\/jagm.1996.0022","volume":"20","author":"S. Peng","year":"1996","unstructured":"Peng, S. and W. Lo. (1996). \u201cEfficient Algorithm for Finding a Core of a Tree with Specified Length.\u201d Journal of Algorithms 20, 445\u2013458.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"5143615_CR32","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0377-2217(93)90329-L","volume":"65","author":"C. ReVelle","year":"1993","unstructured":"ReVelle, C. (1993). \u201cFacility Siting and Integer-Friendly Programming.\u201d European Journal of Operational Research 65(2), 147\u2013158 (Invited review).","journal-title":"European Journal of Operational Research"},{"key":"5143615_CR33","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1111\/j.1538-4632.1970.tb00142.x","volume":"2","author":"C. ReVelle","year":"1970","unstructured":"ReVelle, C. and R. Swain. (1970). \u201cCentral Facilities Location.\u201d Geographical Analysis 2, 30\u201342.","journal-title":"Geographical Analysis"},{"key":"5143615_CR34","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/net.3230200404","volume":"20","author":"M.B. Richey","year":"1990","unstructured":"Richey, M.B. (1990). \u201cOptimal Location of a Path or Tree on a Network with Cycles.\u201d Networks 20, 391\u2013407.","journal-title":"Networks"},{"key":"5143615_CR35","first-page":"529","volume-title":"The Theory of Applications of Graphs","author":"P.J. Slater","year":"1981","unstructured":"Slater, P.J. (1981). \u201cCentrality of Paths and Vertices in a Graph: Cores and Pits.\u201d In G. Chartrand (ed.), The Theory of Applications of Graphs. New York: Wiley, pp. 529\u2013542."},{"issue":"1","key":"5143615_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"P.J. Slater","year":"1982","unstructured":"Slater, P.J. (1982). \u201cLocating Central Paths in a Graph.\u201d Transportation Science 16(1), 1\u201318.","journal-title":"Transportation Science"},{"key":"5143615_CR37","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(93)90132-8","volume":"47","author":"A. Tamir","year":"1993","unstructured":"Tamir, A. (1993). \u201cA Unifying Location Model on Tree Graphs Based on Submodularity Properties.\u201d Discrete Applied Mathematics 47, 275\u2013283.","journal-title":"Discrete Applied Mathematics"},{"key":"5143615_CR38","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0166-218X(98)00059-6","volume":"87","author":"A. Tamir","year":"1998","unstructured":"Tamir, A. (1998). \u201cFully Polynomial Approximation Schemes for Locating a Tree-Shaped Facility: A Generalization of the Knapsack Problem.\u201d Discrete Applied Mathematics 87, 229\u2013243.","journal-title":"Discrete Applied Mathematics"},{"key":"5143615_CR39","doi-asserted-by":"crossref","unstructured":"Tamir, A., J. Puerto, and D. Perez-Brito. (2002). \u201cThe Centdian Subtree on Tree Networks.\u201d Discrete Applied Mathematics 118.","DOI":"10.1016\/S0166-218X(01)00199-8"},{"key":"5143615_CR40","first-page":"261","volume":"3","author":"C.P. Tsouros","year":"1994","unstructured":"Tsouros, C.P. and S.E. Kostopoulou. (1994). \u201cA Multiobjective Network Design Problem with Equity Constraints.\u201d Studies in Regional and Urban Planning 3, 261\u2013277.","journal-title":"Studies in Regional and Urban Planning"},{"key":"5143615_CR41","doi-asserted-by":"crossref","unstructured":"Wang, B.F. (2002). \u201cFinding a Two-Core of a Tree in Linear Time.\u201d To appear in SIAM J. Discrete Mathematics.","DOI":"10.1137\/S0895480100374242"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026154708960.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026154708960\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026154708960.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:12:02Z","timestamp":1747577522000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026154708960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":41,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5143615"],"URL":"https:\/\/doi.org\/10.1023\/a:1026154708960","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}