{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:19Z","timestamp":1761620959554},"reference-count":10,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7710,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1985,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This article describes methods for finding an optimal location for a path\u2010shaped or tree\u2010shaped facility of a specified size in a tree network. Four optimization criteria are examined: minimizing distancesum, minimizing eccentricity, maximizing distancesum, and maximizing eccentricity. Solution algorithms are presented for all but one case.<\/jats:p>","DOI":"10.1002\/net.3230150304","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T19:51:44Z","timestamp":1178913104000},"page":"309-321","source":"Crossref","is-referenced-by-count":69,"title":["The optimal location of a path or tree in a tree network"],"prefix":"10.1002","volume":"15","author":[{"given":"Edward","family":"Minieka","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.462"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.7.3.287"},{"key":"e_1_2_1_5_2","first-page":"233","volume-title":"Location on Networks","author":"Handler G. Y.","year":"1979"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.15.2.98"},{"issue":"980","key":"e_1_2_1_7_2","first-page":"247","article-title":"A linear algorithm for a core of a tree","volume":"1","author":"Morgan C. A.","journal-title":"J. Algorithms"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.16.1.1"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.29.3.523"},{"key":"e_1_2_1_10_2","first-page":"529","volume-title":"The Theory of Applications of Graphs","author":"Slater P. J.","year":"1981"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.29.4.482"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230150304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230150304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T12:55:34Z","timestamp":1697806534000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230150304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["10.1002\/net.3230150304"],"URL":"https:\/\/doi.org\/10.1002\/net.3230150304","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}