{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:31:19Z","timestamp":1773775879922,"version":"3.50.1"},"reference-count":23,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5397,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the problem of locating new facilities with respect to existing facilities on a tree network. The objective is to minimize the maximum of the weighted distances between existing and new facilities and between pairs of new facilities. There are upper bounds on the distances between pairs of new facilities and between new and existing facilities. We give a polynomial order, binary search algorithm, based on rational representation of data. We also present a strongly polynomial order algorithm employing a parameteric approach and exploiting parallelism.<\/jats:p>","DOI":"10.1002\/net.3230220104","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T11:49:24Z","timestamp":1178970564000},"page":"37-54","source":"Crossref","is-referenced-by-count":17,"title":["Distance\u2010constrained multifacility minimax location problems on tree networks"],"prefix":"10.1002","volume":"22","author":[{"given":"E.","family":"Erkut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. L.","family":"Francis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A.","year":"1974"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.1977.tb00589.x"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7537"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.8.2.126"},{"key":"e_1_2_1_6_2","unstructured":"E.ErkutandR. L.Francis Distance\u2010constrained multicenter problems on tree networks. Research Paper 87\u20104 Dept. of Fin. and Mgmt. Sci. Univ. of Alberta Edmonton Canada T6G 2R6 (1987)."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1068\/b150181"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.3.447"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.4.570"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(83)90194-7"},{"key":"e_1_2_1_11_2","volume-title":"Location on Networks","author":"Handler G. Y.","year":"1979"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/0137040"},{"key":"e_1_2_1_13_2","unstructured":"A.Kolen Location Problems on Trees and in the Rectilinear Plane. Stitching Matematisch Centrum Kruislaan 413 1098 SJ Amsterdam The Netherlands (1982)."},{"key":"e_1_2_1_14_2","first-page":"263","volume-title":"Covering problems. Discrete Location Theory","author":"Kolen A.","year":"1990"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.414"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/0212052"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/2157.322410"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.30.3.290"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90079-6"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90150-9"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.16.4.407"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.30.4.725"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.29.4.482"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.6.1363"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T13:42:42Z","timestamp":1698154962000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1002\/net.3230220104"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220104","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}