{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:14:39Z","timestamp":1726514079565},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02022999","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T13:49:15Z","timestamp":1123681755000},"page":"327-341","source":"Crossref","is-referenced-by-count":73,"title":["Massively parallel tabu search for the quadratic assignment problem"],"prefix":"10.1007","volume":"41","author":[{"given":"Jaishankar","family":"Chakrapani","sequence":"first","affiliation":[]},{"given":"Jadranka","family":"Skorin-Kapov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02022999_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0305-0548(92)90050-F","volume":"19","author":"J. Chakrapani","year":"1992","unstructured":"J. Chakrapani and J. Skorin-Kapov, A connectionist approach to the quadratic assignment problem, J. Comp. Oper. Res. 19(1992)287\u2013295.","journal-title":"J. Comp. Oper. Res."},{"key":"BF02022999_CR2","unstructured":"B. Gavish, Manifold search techniques applied to the quadratic assignment problem, Technical report, Owen Graduate School of Management, Vanderbilt University (1991)."},{"key":"BF02022999_CR3","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.24.4.595","volume":"24","author":"A. Geoffrion","year":"1976","unstructured":"A. Geoffrion and G. Graves, Scheduling parallel production lines with changeover costs: Practical applications of a quadratic assignment\/linear programming approach, Oper. Res. 24(1976)595\u2013610.","journal-title":"Oper. Res."},{"key":"BF02022999_CR4","volume-title":"Candidate list strategies and tabu search","author":"F. Glover","year":"1989","unstructured":"F. Glover, Candidate list strategies and tabu search, Technical report, Center for Applied Artificial Intelligence, University of Colorado, Boulder (1989)."},{"key":"BF02022999_CR5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu search. Part I, ORSA J. Comput. 1(1989)190\u2013206.","journal-title":"ORSA J. Comput."},{"key":"BF02022999_CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search. Part II, ORSA J. Comput. 2(1990)4\u201332.","journal-title":"ORSA J. Comput."},{"key":"BF02022999_CR7","volume-title":"Bin packing with tabu search","author":"F. Glover","year":"1991","unstructured":"F. Glover and R. H\u00fcbscher, Bin packing with tabu search, Technical report, Center for Applied Artificial Intelligence, University of Colorado, Boulder (1991)."},{"key":"BF02022999_CR8","unstructured":"W.D. Hillis,The Connection Machine (The MIT Press, 1985)."},{"key":"BF02022999_CR9","volume-title":"A study of diversification strategies for the quadratic assignment problem","author":"J. Kelly","year":"1991","unstructured":"J. Kelly, M. Laguna and F. Glover, A study of diversification strategies for the quadratic assignment problem, Technical report, Graduate School of Business and Administration, University of Colorado, Boulder (1991)."},{"key":"BF02022999_CR10","unstructured":"U. Manber,Introduction to Algorithms (Addison-Wesley, 1989)."},{"key":"BF02022999_CR11","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"C. Nugent","year":"1968","unstructured":"C. Nugent, T. Volmann and J. Ruml, An experimental comparison of techniques for the assignment of facilities to locations, Oper. Res. 16(1968)150\u2013173.","journal-title":"Oper. Res."},{"key":"BF02022999_CR12","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"S. Sahni and T. Gonzalez, P-complete approximation problems, J. ACM 23(1976)555\u2013565.","journal-title":"J. ACM"},{"key":"BF02022999_CR13","doi-asserted-by":"crossref","unstructured":"J. Skorin-Kapov, Extensions of a tabu search adaptation to the quadratic assignment problem, J. Comp. Oper. Res., to appear.","DOI":"10.1016\/0305-0548(94)90015-9"},{"key":"BF02022999_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J. Skorin-Kapov","year":"1990","unstructured":"J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2(1990)33\u201345.","journal-title":"ORSA J. Comput."},{"key":"BF02022999_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1003003","volume":"3","author":"L. Steinberg","year":"1961","unstructured":"L. Steinberg, The backboard wiring problem: A placement algorithm, SIAM Rev. 3(1961)37\u201350.","journal-title":"SIAM Rev."},{"key":"BF02022999_CR16","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Comput. 17(1991)443\u2013455.","journal-title":"Parallel Comput."},{"key":"BF02022999_CR17","unstructured":"Thinking Machines Corporation, Cambridge, MA, Connection Machine Model CM-2, Technical Summary Version 5.1. (May 1989)."},{"key":"BF02022999_CR18","unstructured":"Thinking Machines Corporation, Cambridge, MA, C* Programming Guide, Version 6.0. (November 1990)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02022999.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02022999\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02022999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:39:56Z","timestamp":1557787196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02022999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02022999"],"URL":"https:\/\/doi.org\/10.1007\/bf02022999","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}