{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T04:02:13Z","timestamp":1747627333617,"version":"3.40.5"},"reference-count":27,"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:1020755231275","type":"journal-article","created":{"date-parts":[[2003,3,18]],"date-time":"2003-03-18T20:53:36Z","timestamp":1048020816000},"page":"17-31","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Lower Bound for the Multimedian Location Problem"],"prefix":"10.1007","volume":"110","author":[{"given":"Ranganath","family":"Nuggehalli","sequence":"first","affiliation":[]},{"given":"Timothy J.","family":"Lowe","sequence":"additional","affiliation":[]},{"given":"James E.","family":"Ward","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5099486_CR1","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TSE.1981.226469","volume":"7","author":"S.H. Bokhari","year":"1981","unstructured":"S.H. Bokhari, A shortest tree algorithm for optimal assignment across space and time in a distributed processor system, IEEE Transactions on Software Engineering 7 (1981) 583-589.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"5099486_CR2","volume-title":"Handbook of Combinatorial Optimization, Vol. 3","author":"R.E. Burkard","year":"1998","unstructured":"R.E. Burkard, E. Cela, P.M. Pardalos and L.S. Pitsoulis, The quadratic assignment problem, in: Handbook of Combinatorial Optimization, Vol. 3, eds. D.Z. Du and P.M. Pardalos (Kluwer, Norwell, MA, 1998)."},{"key":"5099486_CR3","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0377-2217(92)90027-7","volume":"63","author":"D.C. Chhajed","year":"1992","unstructured":"D.C. Chhajed and T.J. Lowe, An O(nm) algorithm for a special case of the multimedian location problem on a tree network, European Journal of Operational Research 63 (1992) 222-230.","journal-title":"European Journal of Operational Research"},{"key":"5099486_CR4","doi-asserted-by":"crossref","first-page":"S56","DOI":"10.1287\/opre.40.1.S56","volume":"40","author":"D.C. Chhajed","year":"1992","unstructured":"D.C. Chhajed and T.J. Lowe, M-median andM-center problems with mutual communication: solvable special cases, Operations Research 40 (1992) S56-S66.","journal-title":"Operations Research"},{"key":"5099486_CR5","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BF02591990","volume":"36","author":"A. Dax","year":"1986","unstructured":"A. Dax, A note on the optimality conditions for the euclidean multifacility location problem, Mathematical Programming 36 (1986) 72-80.","journal-title":"Mathematical Programming"},{"key":"5099486_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1068\/b150181","volume":"15","author":"E. Erkut","year":"1988","unstructured":"E. Erkut, R.L. Francis and T.J. Lowe, A multimedian problem with interdistance constraints, Environment and Planning B 15 (1988) 181-190.","journal-title":"Environment and Planning B"},{"key":"5099486_CR7","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1287\/opre.37.3.447","volume":"37","author":"E. Erkut","year":"1989","unstructured":"E. Erkut, R.L. Francis, T.J. Lowe and A. Tamir, Equivalent mathematical programming formulations of monotonic tree network location problems, Operations Research 37 (1989) 447-461.","journal-title":"Operations Research"},{"key":"5099486_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"R.W. Floyd, Algorithm 97, Shortest path, Communications of the ACM 5 (1962) 345.","journal-title":"Communications of the ACM"},{"key":"5099486_CR9","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1287\/opre.26.4.570","volume":"26","author":"R.L. Francis","year":"1978","unstructured":"R.L. Francis, T.J. Lowe and H.D. Ratliff, Distance constraints for tree network multifacility location problems, Operations Research 26 (1978) 570-596.","journal-title":"Operations Research"},{"key":"5099486_CR10","volume-title":"Facility Layout and Location: An Analytical Approach","author":"R.L. Francis","year":"1974","unstructured":"R.L. Francis, L.F. McGinnis and J.A. White, Facility Layout and Location: An Analytical Approach (Prentice Hall, Englewood Cliffs, NJ, 1974)."},{"key":"5099486_CR11","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1287\/opre.46.6.912","volume":"46","author":"P. Hahn","year":"1998","unstructured":"P. Hahn and T. Grant, Lower bounds for the quadratic assignment problem based upon a dual formulation, Operations Research 46 (1998) 912-922.","journal-title":"Operations Research"},{"key":"5099486_CR12","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1287\/opre.20.5.967","volume":"20","author":"S.L. Hakimi","year":"1972","unstructured":"S.L. Hakimi and S.N. Maheshwari, Optimum locations of centers in networks, Operations Research 20 (1972) 967-973.","journal-title":"Operations Research"},{"key":"5099486_CR13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/opre.39.1.100","volume":"39","author":"J.N. Hooker","year":"1991","unstructured":"J.N. Hooker, R.S. Garfinkel and C.K. Chen, Finite dominating sets for network location problems, Operations Research 39 (1991) 100-118.","journal-title":"Operations Research"},{"key":"5099486_CR14","volume-title":"Tree Network and Planar Rectilinear Location Theory","author":"A.W.J. Kolen","year":"1986","unstructured":"A.W.J. Kolen, Tree Network and Planar Rectilinear Location Theory, CWI Tract 25 (Center for Mathematics and Computer Science, Amsterdam, 1986)."},{"key":"5099486_CR15","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1057\/jors.1967.73","volume":"18","author":"J. Levy","year":"1972","unstructured":"J. Levy, An extended theorem for location on a network, Operations Research Quarterly 18 (1972) 433-442.","journal-title":"Operations Research Quarterly"},{"key":"5099486_CR16","volume-title":"Facility Location-Models and Methods","author":"R.F. Love","year":"1988","unstructured":"R.F. Love, J.G. Morris and G.O. Wesolowski, Facility Location-Models and Methods (North-Holland, Amsterdam, 1988)."},{"key":"5099486_CR17","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0167-6377(89)90022-9","volume":"8","author":"V.F. Magirou","year":"1989","unstructured":"V.F. Magirou and J.Z. Milis, An algorithm for the multiprocessor assignment problem, Operations Research Letters 8 (1989) 351-356.","journal-title":"Operations Research Letters"},{"key":"5099486_CR18","series-title":"Research Report","volume-title":"Lower bounds for the quadratic semi-assignment problem","author":"F. Malucelli","year":"1993","unstructured":"F. Malucelli and D. Pretolani, Lower bounds for the quadratic semi-assignment problem, Research Report #955, Centre de Recherche les Transports, Universite de Montreal, Montreal (1993)."},{"key":"5099486_CR19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0377-2217(87)90020-8","volume":"31","author":"C. Michelot","year":"1987","unstructured":"C. Michelot, Localization in multifacility location theory, European Journal of Operational Research 31 (1987) 177-184.","journal-title":"European Journal of Operational Research"},{"key":"5099486_CR20","unstructured":"R.S. Nuggehalli, Multi-facility network location problem, Ph.D. dissertation, Purdue University (1993)."},{"key":"5099486_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1379-3","volume-title":"Location, Scheduling, Design and Integer Programming","author":"M.W. Padberg","year":"1996","unstructured":"M.W. Padberg and M.P. Rijal, Location, Scheduling, Design and Integer Programming (Kluwer, Norwell, MA, 1996)."},{"key":"5099486_CR22","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1287\/opre.36.3.485","volume":"36","author":"F. Rado","year":"1988","unstructured":"F. Rado, The Euclidean multifacility location problem, Operations Research 36 (1988) 485-492.","journal-title":"Operations Research"},{"key":"5099486_CR23","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/opre.40.1.188","volume":"40","author":"J.B. Rosen","year":"1992","unstructured":"J.B. Rosen and G.L. Xue, On the convergence of Miehle's algorithm for the Euclidean multifacility location problem, Operations Research 40 (1992) 188-192.","journal-title":"Operations Research"},{"key":"5099486_CR24","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(93)90099-3","volume":"14","author":"A. Tamir","year":"1993","unstructured":"A. Tamir, Complexity results for the p-median problem with mutual communication, Operations Research Letters 14 (1993) 79-84.","journal-title":"Operations Research Letters"},{"key":"5099486_CR25","unstructured":"A. Tamir, Personal communication (1999)."},{"key":"5099486_CR26","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"S. Warshall, A theorem on Boolean matrices, Journal of Association of Computing Machinery 9 (1962) 11-12.","journal-title":"Journal of Association of Computing Machinery"},{"key":"5099486_CR27","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1287\/trsc.7.1.18","volume":"7","author":"R.E. Wendell","year":"1973","unstructured":"R.E. Wendell and A.P. Hurter, Optimal locations on a network, Transportation Science 7 (1973) 18-23.","journal-title":"Transportation Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020755231275.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020755231275\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020755231275.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:24:11Z","timestamp":1747578251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020755231275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":27,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["5099486"],"URL":"https:\/\/doi.org\/10.1023\/a:1020755231275","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}