{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:46:30Z","timestamp":1757450790373,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,25]],"date-time":"2005-06-25T00:00:00Z","timestamp":1119657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,25]]},"DOI":"10.1145\/1068009.1068118","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"649-650","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A hybrid evolutionary algorithm for the p-median problem"],"prefix":"10.1145","author":[{"given":"Istv\u00e1n","family":"Borgulya","sequence":"first","affiliation":[{"name":"University of P\u00e9cs, Hungary"}]}],"member":"320","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Drezner","author":"Alp O.","year":"2003","unstructured":"Alp , O. , Erkut , E. , Drezner , Z. : An Efficient Genetic Algorithm for the p-Median Problem. Annals of Operations research 122. 2003 . 21--42 Alp, O., Erkut, E., Drezner, Z.: An Efficient Genetic Algorithm for the p-Median Problem. Annals of Operations research 122. 2003. 21--42"},{"key":"e_1_3_2_1_2_1","volume-title":"Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research, 94","author":"Beasley J.E.","year":"1996","unstructured":"Beasley , J.E. , Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research, 94 . 1996 . 392--404. Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research, 94. 1996. 392--404."},{"key":"e_1_3_2_1_3_1","volume-title":"A Heuristics Method for the Quadratic Assignment Problem. Central European Journal of Operations research 11(1)","author":"Borgulya I.","year":"2003","unstructured":"Borgulya , I. : A Heuristics Method for the Quadratic Assignment Problem. Central European Journal of Operations research 11(1) 2003 . 3--16. Borgulya, I.: A Heuristics Method for the Quadratic Assignment Problem. Central European Journal of Operations research 11(1) 2003. 3--16."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011336210885"},{"volume-title":"Mladenovi\u0107","author":"Hansen P.","key":"e_1_3_2_1_5_1","unstructured":"Hansen , P. , Mladenovi\u0107 , N. : Variable Neighborhood Search for the p-median. Location Science , Vol. 5 No. 4. 1997. 207--226. Hansen, P., Mladenovi\u0107, N.: Variable Neighborhood Search for the p-median. Location Science, Vol.5 No. 4. 1997. 207--226."},{"key":"e_1_3_2_1_7_1","volume-title":"Ravis\u00e9","author":"Sebag M.","year":"1997","unstructured":"Sebag , M. , Schoenauer , M. , Ravis\u00e9 , C. : Toward Civilized Evolution: Developing Inhibitions. In : Back, T. (ed): Proc. of the 7th International Conference on Genetic Algorithm. Morgan Kaufmann Pub . San Francisco, 1997 291--298. Sebag, M., Schoenauer, M., Ravis\u00e9, C.: Toward Civilized Evolution: Developing Inhibitions. In: Back, T. (ed): Proc. of the 7th International Conference on Genetic Algorithm. Morgan Kaufmann Pub. San Francisco, 1997 291--298."}],"event":{"name":"GECCO05: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Washington DC USA","acronym":"GECCO05"},"container-title":["Proceedings of the 7th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068118","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1068009.1068118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:59Z","timestamp":1750262879000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,25]]},"references-count":6,"alternative-id":["10.1145\/1068009.1068118","10.1145\/1068009"],"URL":"https:\/\/doi.org\/10.1145\/1068009.1068118","relation":{},"subject":[],"published":{"date-parts":[[2005,6,25]]},"assertion":[{"value":"2005-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}