{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:40:04Z","timestamp":1747579204786,"version":"3.40.5"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":[[2002,2]]},"DOI":"10.1023\/a:1020719718071","type":"journal-article","created":{"date-parts":[[2003,3,18]],"date-time":"2003-03-18T20:53:36Z","timestamp":1048020816000},"page":"133-151","source":"Crossref","is-referenced-by-count":3,"title":["The Maximum Utilization Subtree Problem"],"prefix":"10.1007","volume":"110","author":[{"given":"James W.","family":"George","sequence":"first","affiliation":[]},{"given":"Charles S.","family":"ReVelle","sequence":"additional","affiliation":[]},{"given":"John R.","family":"Current","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"5099493_CR1","first-page":"319","volume":"30","author":"Y.P. Aneja","year":"1992","unstructured":"Y.P. Aneja and K.P.K. Nair, Location of a tree shaped facility in a network, INFOR 30(4) (1992) 319-324.","journal-title":"INFOR"},{"key":"5099493_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0166-218X(85)80002-0","volume":"11","author":"R.I. Becker","year":"1985","unstructured":"R.I. Becker and Y. Perl, Finding the two-core of a tree, Discrete Applied Mathematics 11 (1985) 103-113.","journal-title":"Discrete Applied Mathematics"},{"key":"5099493_CR3","volume-title":"Distributed Comupting: Associated Combinatorial Problems","author":"T.B. Boffey","year":"1992","unstructured":"T.B. Boffey, Distributed Comupting: Associated Combinatorial Problems (Blackwell, Oxford, 1992)."},{"key":"5099493_CR4","unstructured":"R.L. Church and J.R. Current, Maximal covering tree problems, Working Paper Series, WPS 89-47, College of Business, Ohio State University (July, 1989)."},{"key":"5099493_CR5","unstructured":"R.L. Church and J.R. Current, The minimal cost\/maximal covering forest problem on a tree, in: Fifth International Symposium on Locational Decisions, Lake Arrowhead, CA (1990)."},{"key":"5099493_CR6","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":"R.L. Church and J.R. Current, Maximal covering tree problems, Naval Research Logistics 40 (1993) 129-142.","journal-title":"Naval Research Logistics"},{"key":"5099493_CR7","volume-title":"Multiobjective Programming and Planning","author":"J.L. Cohon","year":"1978","unstructured":"J.L. Cohon, Multiobjective Programming and Planning (Academic Press, New York, 1978)."},{"key":"5099493_CR8","volume-title":"Multiobjective design of transportation networks","author":"J.R. Current","year":"1981","unstructured":"J.R. Current, Multiobjective design of transportation networks, Ph.D. dissertation, The Johns Hopkins University, Baltimore, MD (1981)."},{"key":"5099493_CR9","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/0377-2217(91)90309-J","volume":"52","author":"J.R. Current","year":"1991","unstructured":"J.R. Current and H. Pirkul, The hierarchical transportation network with transshipment facilities, European Journal of Operational Research 52 (1991) 338-347.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5099493_CR10","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"J.R. Current","year":"1989","unstructured":"J.R. Current and D.A. Schilling, The Covering Salesman Problem, Transportation Science 23(3) (1989) 208-213.","journal-title":"Transportation Science"},{"key":"5099493_CR11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","volume":"73","author":"J.R. Current","year":"1994","unstructured":"J.R. Current and D.A. Schilling, The Median Tour and Maximal Covering Tour Problems: Formulations and heuristics, European Journal of Operational Research 73 (1994) 114-126.","journal-title":"European Journal of Operational Research"},{"key":"5099493_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0377-2217(92)90204-M","volume":"58","author":"B. Gavish","year":"1992","unstructured":"B. Gavish, Topological design of computer communications networks-The overall design problem, European Journal of Operational Research 58 (1992) 149-172.","journal-title":"European Journal of Operational Research"},{"key":"5099493_CR13","volume-title":"Subtree location on tree networks applied to transportation and communication network design","author":"J.W. George","year":"1997","unstructured":"J.W. George, Subtree location on tree networks applied to transportation and communication network design, Ph.D. dissertation, The Johns Hopkins University, Baltimore, MD (1997)."},{"key":"5099493_CR14","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1002\/net.3230230605","volume":"23","author":"S.L. Hakimi","year":"1993","unstructured":"S.L. Hakimi, E.F. Schmeichel and M. Labbe, On locating path-or tree-shaped facilities on networks, Networks 23 (1993) 543-555.","journal-title":"Networks"},{"issue":"2","key":"5099493_CR15","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/trsc.15.2.98","volume":"15","author":"S.M. Hedetniemi","year":"1981","unstructured":"S.M. Hedetniemi, E.J. Cockayne and S.T. Hedetniemi, Linear algorithms for finding the Jordan center and path center of a tree, Transportation Science 15(2) (1981) 98-114.","journal-title":"Transportation Science"},{"issue":"4","key":"5099493_CR16","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/trsc.23.4.288","volume":"23","author":"V.A. Hutson","year":"1989","unstructured":"V.A. Hutson and Ch.S. ReVelle, Maximal direct covering tree problems, Transportation Science 23(4) (1989) 288-299.","journal-title":"Transportation Science"},{"key":"5099493_CR17","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0377-2217(93)90141-9","volume":"65","author":"V.A. Hutson","year":"1993","unstructured":"V.A. Hutson and Ch.S. ReVelle, Indirect covering tree problems on spanning tree networks, European Journal of Operational Research 65 (1993) 20-32.","journal-title":"European Journal of Operational Research"},{"key":"5099493_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02097806","volume":"18","author":"T.U. Kim","year":"1989","unstructured":"T.U. Kim, T.J. Lowe, J.E.Ward and R.L. Francis, A minimum length covering subgraph of a network, Annals of Operations Research 18 (1989) 245-260.","journal-title":"Annals of Operations Research"},{"key":"5099493_CR19","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":"T.U. Kim, T.J. Lowe, J.E. Ward and R.L Francis, A minimal length covering subtree of a tree, Naval Research Logistics 37 (1990) 309-326.","journal-title":"Naval Research Logistics"},{"issue":"2","key":"5099493_CR20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0305-0548(88)90003-2","volume":"15","author":"R.K. Kincaid","year":"1988","unstructured":"R.K. Kincaid, T.J. Lowe and Th.L. Morin, The location of central structures in trees, Computers and Operations Research 15(2) (1988) 103-113.","journal-title":"Computers and Operations Research"},{"key":"5099493_CR21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal Jr.","year":"1956","unstructured":"J.B. Kruskal, Jr., On the shortest spanning subtree of a graph and the Traveling Salesman Problem, Proceedings of the American Mathematical Society 7 (1956) 48-50.","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"6","key":"5099493_CR22","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/0305-0548(93)90117-2","volume":"20","author":"C.-H. Lee","year":"1993","unstructured":"C.-H. Lee, H.-B. Ro and D.-W. Tcha, Topological design of a two-level network with ring-star configuration, Computers and Operations Research 20(6) (1993) 625-637.","journal-title":"Computers and Operations Research"},{"key":"5099493_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"Th.L.Magnanti and R.T. Wong, Network design and transportation planning: Models and algorithms, Transportation Science 18 (1984) 1-55.","journal-title":"Transportation Science"},{"key":"5099493_CR24","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/0377-2217(95)00321-5","volume":"95","author":"J.A. Mesa","year":"1996","unstructured":"J.A. Mesa and T.B. Boffey, Review of extensive facility location in networks, European Journal of Operational Research 95 (1996) 592-603.","journal-title":"European Journal of Operational Research"},{"key":"5099493_CR25","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.3230150304","volume":"15","author":"E. Minieka","year":"1985","unstructured":"E. Minieka, The optimal location of a path or tree in a tree network, Networks 15 (1985) 309-321.","journal-title":"Networks"},{"key":"5099493_CR26","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0196-6774(83)90015-9","volume":"4","author":"E. Minieka","year":"1983","unstructured":"E. Minieka and N.H. Patel, On finding the core of a tree with a specified length, Journal of Algorithms 4 (1983) 345-352.","journal-title":"Journal of Algorithms"},{"key":"5099493_CR27","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"C. Morgan","year":"1980","unstructured":"Ch.A. Morgan and P.J. Slater, A linear algorithm for a core of a tree, Journal of Algorithms 1 (1980) 247-258.","journal-title":"Journal of Algorithms"},{"key":"5099493_CR28","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/jagm.1993.1034","volume":"15","author":"S. Peng","year":"1993","unstructured":"S. Peng, A.B. Stephens and Y. Ysha, Algorithms for the fixed-charge assigning users to a sources problem, Journal of Algorithms 15 (1993) 143-159.","journal-title":"Journal of Algorithms"},{"key":"5099493_CR29","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02094332","volume":"36","author":"H. Pirkul","year":"1992","unstructured":"H. Pirkul and V. Nagarajan, Locating concentrators in centralized computer networks, Annals of Operations Research 36 (1992) 247-261.","journal-title":"Annals of Operations Research"},{"key":"5099493_CR30","doi-asserted-by":"crossref","unstructured":"R.C. Prim, Shortest connection matrix and some generalizations, Bell System Technical Journal (1957) 1389-1401.","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"5099493_CR31","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0377-2217(93)90329-L","volume":"65","author":"C. ReVelle","year":"1993","unstructured":"Ch.S. ReVelle, Facility siting and integer-friendly programming, European Journal of Operational Research 65 (1993) 147-158.","journal-title":"European Journal of Operational Research"},{"key":"5099493_CR32","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/net.3230200404","volume":"20","author":"M.B. Richey","year":"1990","unstructured":"M.B. Richey, Optimal location of a path or tree on a network with cycles, Networks 20 (1990) 391-407.","journal-title":"Networks"},{"key":"5099493_CR33","unstructured":"P.J. Slater, Centrality of paths and vertices in a graph: Cores and pits, in: The Theory of Applications of Graphs, ed. G. Chartrand (Wiley, 1981) pp. 529-542."},{"issue":"1","key":"5099493_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"P.J. Slater","year":"1982","unstructured":"P.J. Slater, Locating central paths in a graph, Transportation Science 16(1) (1982) 1-18.","journal-title":"Transportation Science"},{"key":"5099493_CR35","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230220302","volume":"22","author":"A. Tamir","year":"1992","unstructured":"A. Tamir and T.J. Lowe, The generalized P-forest problem on a network, Networks 22 (1992) 217-230.","journal-title":"Networks"},{"key":"5099493_CR36","first-page":"261","volume":"3","author":"C.P. Tsouros","year":"1994","unstructured":"C.P. Tsouros and S.E. Kostopoulou, Multiobjective network design problem with equity constraints, Studies in Regional and Urban Planning 3 (1994) 261-277.","journal-title":"Studies in Regional and Urban Planning"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020719718071.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020719718071\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020719718071.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:06:44Z","timestamp":1747577204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020719718071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":36,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["5099493"],"URL":"https:\/\/doi.org\/10.1023\/a:1020719718071","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}