{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T22:37:25Z","timestamp":1721169445464},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,12,21]],"date-time":"2005-12-21T00:00:00Z","timestamp":1135123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s00291-005-0010-7","type":"journal-article","created":{"date-parts":[[2005,12,20]],"date-time":"2005-12-20T08:41:21Z","timestamp":1135068081000},"page":"417-436","source":"Crossref","is-referenced-by-count":20,"title":["Finding a cluster of points and the grey pattern quadratic assignment problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Zvi","family":"Drezner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,12,21]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Beasley JE (1990) OR-library\u2014distributing test problems by electronic mail. J Oper Res Soc 41:1069\u20131072. Also available at http:\/\/mscmga.ms.ic.ac.uk\/jeb\/orlib\/pmedinfo.html","DOI":"10.1057\/jors.1990.166"},{"key":"10_CR2","unstructured":"Berman O, Drezner Z (2005) The multiple server location problem. J Oper Res Soc (in press)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Current J, Daskin M, Schilling D (2002) Discrete network location models. Ch. 3 In: Drezner Z, Hamacher HW (eds) Location analysis: applications and theory, pp 81\u2013118","DOI":"10.1007\/978-3-642-56082-8_3"},{"key":"10_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032343","volume-title":"Network and discrete location: models, algorithms and applications","author":"M Daskin","year":"1995","unstructured":"Daskin M (1995) Network and discrete location: models, algorithms and applications. Wiley, New York"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/mnsc.27.7.848","volume":"27","author":"Z Drezner","year":"1981","unstructured":"Drezner Z (1981) On a modified one-center model. Manage Sci 27:848\u2013851","journal-title":"Manage Sci"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Drezner Z, Hahn PM, Taillard ED (2005) Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann Oper Res 139:65\u201394","DOI":"10.1007\/s10479-005-3444-z"},{"key":"10_CR7","unstructured":"Drezner Z, Marcoulides GA (2005) On the range of tabu tenure in solving quadratic assignment problems. Under review"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13:533\u2013549","journal-title":"Comput Oper Res"},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer, Boston"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelat CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economics activities. Econometrica 25:53\u201376","journal-title":"Econometrica"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Misevicius A (2003a) Ruin and recreate principle based approach for the quadratic assignment problem. Lecture notes in computer science, vol 2723. In: Cant-Paz E, Foster JA, Deb K, et al (eds) Genetic and Evolutionary Computation\u2014GECCO 2003 (Chicago, USA), Proceedings, Part I, Springer, Berlin Heidelberg New York pp. 598\u2013609","DOI":"10.1007\/3-540-45105-6_71"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0950-7051(03)00027-3","volume":"16","author":"A Misevicius","year":"2003","unstructured":"Misevicius A (2003b) Genetic algorithm hybridized with ruin and recreate procedure: application to the quadratic assignment problem. Knowl Based Syst 16:261\u2013268","journal-title":"Knowl Based Syst"},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.knosys.2004.03.001","volume":"17","author":"A Misevicius","year":"2004","unstructured":"Misevicius A (2004) An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowl Based Syst 17:65\u201373","journal-title":"Knowl Based Syst"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Misevicius A (2005) A tabu search algorithm for the quadratic assignment problem. Working paper, Kaunas University of Technology, Kaunas, Lithuania Comput Optim Appl 30:95\u2013111","DOI":"10.1007\/s10589-005-4562-x"},{"key":"10_CR16","volume-title":"Facility location: applications and theory","author":"F Rendl","year":"2002","unstructured":"Rendl F (2002) The quadratic assignment problem. In: Drezner Z, Hamacher H (eds) Facility location: applications and theory. Springer, Berlin Heidelberg New York"},{"key":"10_CR17","volume-title":"Modern methods for business research","author":"S Salhi","year":"1998","unstructured":"Salhi S (1998) Heuristic search methods. In: Marcoulides G (ed) Modern methods for business research. Lawrence Erlbaum Associates, Mahwah, NJ"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"ED Taillard","year":"1995","unstructured":"Taillard ED (1995) Comparison of iterative searches for the quadratic assignment problem. Location Science 3:87\u2013105","journal-title":"Location Science"},{"key":"10_CR19","volume-title":"Adaptive memories for the quadratic assignment problem. Tech. report IDSIA-8797","author":"ED Taillard","year":"1997","unstructured":"Taillard ED, Gambardella LM (1997) Adaptive memories for the quadratic assignment problem. Tech. report IDSIA-8797. Lugano, Switzerland"},{"key":"10_CR20","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"MB Teitz","year":"1968","unstructured":"Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res 16:955-961","journal-title":"Oper Res"},{"key":"10_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0377-2217(82)90109-6","volume":"11","author":"CDT Watson-Gandy","year":"1982","unstructured":"Watson-Gandy CDT (1982) Heuristic procedures for the M-partial cover problem on a plane. Eur J Oper Res 11:149-157","journal-title":"Eur J Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-005-0010-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-005-0010-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-005-0010-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:53Z","timestamp":1559041193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-005-0010-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,21]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["10"],"URL":"https:\/\/doi.org\/10.1007\/s00291-005-0010-7","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,21]]}}}