{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:07:59Z","timestamp":1760296079587},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1016\/s0377-2217(98)00268-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:48:22Z","timestamp":1027604902000},"page":"522-532","source":"Crossref","is-referenced-by-count":44,"title":["A gamma heuristic for the p-median problem"],"prefix":"10.1016","volume":"117","author":[{"given":"K.E","family":"Rosing","sequence":"first","affiliation":[]},{"given":"C.S","family":"ReVelle","sequence":"additional","affiliation":[]},{"given":"D.A","family":"Schilling","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00268-9_BIB1","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float: An analytical study of exact and approximate algorithms","volume":"23","author":"Cornuejols","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1068\/a240289","article-title":"Strategies for solving large location-allocation problems by heuristic methods","volume":"24","author":"Densham","year":"1992","journal-title":"Environment and Planning A"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB3","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01434270","article-title":"A more efficient heuristic for solving large p-median problems","volume":"71","author":"Densham","year":"1992","journal-title":"Papers in Regional Science"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB4","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1287\/opre.28.5.1112","article-title":"A dual-Bounded algorithm for the p-median problem","volume":"28","author":"Galv\u00e3o","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/trsc.8.3.217","article-title":"An algorithm for the m-median plant location problem","volume":"8","author":"Garfinkel","year":"1974","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB6","unstructured":"Goodchild, M.F., Noronha, V., 1983. Location-allocation for small computers, Monograph No. 8, Department of Geography, University of Iowa, Iowa City, Iowa"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB7","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum locations of switching centers and the absolute centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB8","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","article-title":"Optimum distribution of switching centers in a communications network and some related graph theoretic problems","volume":"13","author":"Hakimi","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1068\/a160305","article-title":"The p-median structure as a unified linear model for location-allocation analysis","volume":"16","author":"Hillsman","year":"1984","journal-title":"Environment and Planning A"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB10","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1068\/a281699","article-title":"Analysis and computational schemes for p-median heuristics","volume":"28","author":"Horn","year":"1996","journal-title":"Environment and Planning A"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1057\/jors.1964.47","article-title":"On the location of supply points to minimize transport costs","volume":"15","author":"Maranzana","year":"1964","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB12","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1287\/opre.25.4.709","article-title":"An algorithm for the p-median problem","volume":"25","author":"Narula","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1111\/j.1538-4632.1970.tb00142.x","article-title":"Central facilities location","volume":"2","author":"ReVelle","year":"1970","journal-title":"Geographical Analysis"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","article-title":"An efficient tabu search procedure for the p-median problem","volume":"96","author":"Rolland","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1068\/b240059","article-title":"An empirical investigation of the effectiveness of a vertex substitution heuristic","volume":"24","author":"Rosing","year":"1997","journal-title":"Environment and Planning B"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB16","unstructured":"Rosing, K.E., 1998. Heuristic concentration: A study of stage one. Tinbergen Institute Discussion Papers. Tinbergen Institute, Amsterdam\/Rotterdam"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB17","unstructured":"Rosing, K.E., Hodgson, M.J., 1998. A geographical and combinatorial analysis of p-median solutions. Tinbergen Institute Discussion Papers. Tinbergen Institute, Amsterdam\/Rotterdam"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(96)00100-2","article-title":"Heuristic concentration: Two stage solution construction","volume":"97","author":"Rosing","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0377-2217(97)00310-X","article-title":"Heuristic concentration and tabu search: A head to head comparison","volume":"104","author":"Rosing","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB20","unstructured":"Rushton, G., Kohler, J.A., 1973. Alloc. in: Rushton, G., Goodchild, M.F., Ostresh Jr., L.W., Computer programs for location-allocation problems, Monograph No. 6, Department of Geography, University of Iowa, Iowa City, Iowa, pp. 163\u2013187"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB21","doi-asserted-by":"crossref","unstructured":"Serra, D., ReVelle, C.S., 1999. Surviving in a competitive spatial market: The threshold capture model. Journal of Regional Science, in review","DOI":"10.1111\/0022-4146.00153"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB22","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/mnsc.21.2.189","article-title":"A parametric decomposition approach for the solution of uncapacitated location problems","volume":"21","author":"Swain","year":"1974","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB23","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","article-title":"Heuristic methods for estimating the generalised vertex median of a weighted graph","volume":"16","author":"Teitz","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00268-9_BIB24","doi-asserted-by":"crossref","unstructured":"Whitaker, R.A., 1983. A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR 21, 95\u2013108; see also Errata, 1984. INFOR 22, 70\u201371","DOI":"10.1080\/03155986.1984.11731914"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798002689?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798002689?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T09:21:03Z","timestamp":1556097663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798002689"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0377221798002689"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00268-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}